Abstract: A method of determining which computer program functions are changed by a source code modification to a computer program's source code. The method includes compiling the computer program's source code, using a compiler that generates a relocation entry for each program access to a program function or a program data item. The method further includes compiling source code resulting from modifying the computer program's source code with the source code modification, using a compiler that generates a relocation entry for each program access to a program function or a program data item The method further includes constructing a list of object code differences by comparing the compiled source code, and excluding from the list specified object code differences.

Abstract: An object code hot update system generates hot updates for patching running programs by analyzing upstream post-patch code, augmenting the upstream post-patch code to provide augmented post-patch code with additional initialization functionality. The system further provides techniques to identify a candidate extra-change site in upstream post-patch code and modify the upstream post-patch code to generate a hot update.

Abstract: In a method of modifying code of a running computer program so as to modify the running computer program without having to restart the running computer program for changes to the running computer program to take effect, the improvement is disclosed of: (a) comparing differences in the running program's running binary code versus object code produced by compiling the running program's source code and (b) using the results of step (a), determining what values to use for symbols in said changes to the program. The compiling may be performed using either the compiler originally used to compile the running program or a different compiler. A data storage medium having instructions stored therein for a computer to perform the improved method is also disclosed.

Abstract: An improved method of modifying code of a running computer program is disclosed that includes the following steps, performed in the order indicated: (a) determining the functions that will be modified due to desired changes to the running computer program; (b) using the results of step (a), determining the start memory address and the end memory address of such a function; and (c) using the results of step (b) determining, for such a function, whether an execution stack of any thread in the running computer program contains a specified numeric value; and (d) using the results of step (c), determining whether the running computer program is currently in a state of execution such that the function can be modified safely. A data storage medium containing computer instructions to perform the improved method is also disclosed.

Abstract: In a method of determining which computer program functions are changed by a source code modification to a computer program's source code, the improvement of including the following steps, not necessarily performed in the order indicated: (a)—compiling the computer program's source code, using a compiler that generates a relocation entry for each program access to a program function or a program data item; (b)—compiling source code resulting from modifying the computer program's source code with the source code modification, using a compiler that generates a relocation entry for each program access to a program function or a program data item; and (c)—constructing a list of object code differences by comparing the outputs of steps (a) versus (b), and excluding from the list specified object code differences. A data storage medium containing computer instructions to perform the improved method is also disclosed.

Abstract: In a method of modifying code of a running computer program so as to modify the running computer program without having to restart the running computer program for changes to the running computer program to take effect, the improvement is disclosed of: (a) comparing differences in the running program's running binary code versus object code produced by compiling the running program's source code and (b) using the results of step (a), determining what values to use for symbols in said changes to the program. The compiling may be performed using either the compiler originally used to compile the running program or a different compiler. A data storage medium having instructions stored therein for a computer to perform the improved method is also disclosed.

Abstract: In a method of simplifying simulation of a wireless communication network, the network may be divided into one or more neighborhoods. A neighborhood may be represented by a given cell to be evaluated and possibly one or more neighbor cells of the given cell. A desired simulation of one or more of the neighborhoods may be implemented in order to evaluate network performance. The neighborhood may be determined as a function of reverse link interference information, path loss information, or on a geographic distance between cells.