Abstract: A computer-aided method (FIG. 12) for developing software by which programmers may implement different features of an application as independent reusable components, even though these features affect the control flows of one another. A programmer may add new features to an application without the labor intensive tasks of examining and modifying existing code. The programmer uses a set of programming language constructs to specify nonprocedural program units, organize the program units into reusable features and integrate several features together into a feature package. An interaction detection algorithm analyzes program units and determines whether there is interaction among program units in a feature and among features in a feature package. The programmer must resolve the interaction, if detected, before the programs can be executed. A run time system specification supports the semantics of the programming language constructs and preserves the conditions that enable interaction detection.

Abstract: A computer-aided method (FIG. 12) for developing software by which programmers may implement different features of an application as independent reusable components, even though these features affect the control flows of one another. A programmer may add new features to an application without the laborintensive tasks of examining and modifying existing code. The programmer uses a set of programming language constructs to specify nonprocedural program units, organize the program units into reusable features and integrate several features together into a feature package. An interaction detection algorithm analyzes program units and determines whether there is interaction among program units in a feature and among features in a feature package. The programmer must resolve the interaction, if detected, before the programs can be executed. A run time system specification supports the semantics of the programming language constructs and preserves the conditions that enable interaction detection.

Abstract: A software tool and methods for preventing software modifications from invalidating previously passed integration test cases is provided. The software tool and methods automatically modify an integrated software subroutine to collect test data for selected units of the integrated software. The software tool and methods also generate a software test environment including a driver and one or more stubs for each selected software unit. Subsequent versions of the software unit are then stimulated by the driver and stubs using the collected test data. The responses from the new version of the software unit are compared to the responses collected from the old version. Differences between the responses of the two software version are flagged, thereby preventing software modifications on the software unit from invalidating previously passed tests. Furthermore, the software tool and methods automate the incremental integration and testing of software units whose modifications are related.

Abstract: A software tool and methods for preventing software modifications from invalidating previously passed integration test cases is provided. The software tool and methods automatically modify an integrated software subroutine to collect test data for selected units of the integrated software. The software tool and methods also generate a software test environment including a driver and one or more stubs for each selected software unit. Subsequent versions of the software unit are then stimulated by the driver and stubs using the collected test data. The responses from the new version of the software unit are compared to the responses collected from the old version. Differences between the responses of the two software version are flagged, thereby preventing software modifications on the software unit from invalidating previously passed tests. Furthermore, the software tool and methods automate the incremental integration and testing of software units whose modifications are related.

Abstract: A communication session is established between a client (102) and a server (104) over a first bearer network (106). A session identifier is produced (304), which is compressed (306). Messages or packets sent between the client and server during a first connection include the compressed session identifier and a first envelope identifier. At some time the first connection is terminated, and a second connection is initiated on a second bearer network. At the occurrence of the break, at both the client and server, a session transition control block is set up and includes the first envelope identifier. The session transition control block is used to map messages or packets received after the break to the correct session after resuming the session over a second connection with a second envelope identifier.

Abstract: Optimal handover margins in a cellular communication system (100) are determined by computing a power budget (701) for each base station/neighbor combination in the communication system (100) and determining a probability distribution function (703) for each base station/neighbor combination in the communication system (100). Once the probability distribution function for each base station/neighbor combination is known, optimal handover margins are determined by maximizing communication system traffic over all base stations while at the same time holding call quality to acceptable levels.