|Publication number||US6748584 B1|
|Application number||US 09/474,389|
|Publication date||Jun 8, 2004|
|Filing date||Dec 29, 1999|
|Priority date||Dec 29, 1999|
|Also published as||US7296261, US20040221270, WO2001048601A2, WO2001048601A3|
|Publication number||09474389, 474389, US 6748584 B1, US 6748584B1, US-B1-6748584, US6748584 B1, US6748584B1|
|Inventors||Emmett Witchel, Christopher D. Metcalf, Andrew E. Ayers|
|Original Assignee||Veritas Operating Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (47), Non-Patent Citations (24), Referenced by (109), Classifications (10), Legal Events (9)|
|External Links: USPTO, USPTO Assignment, Espacenet|
For a number of software engineering applications, it would be helpful to know how two related versions of a computer program compare. In particular, if changes are made to a “baseline version” of a program, resulting in a newer or updated version, and if source code is available for both versions, the source code difference of the baseline and current versions is easy to obtain through standard textual comparison tools, such as the UNIX “diff” command.
There are two major problems with this approach. First, the source code may not be available, especially for the older baseline version. Second, and more fundamentally, a source-code difference does not directly point out all the portions of a program that may have different semantics. For instance, if the type, or format, of a program variable is changed, then all the executable code, i.e., computation and logic, that mentions or references that variable will in general be different as well.
For software testing applications, it is desirable to know which code should be re-tested when a program is modified. As shown above, the source code difference is generally insufficient. While this problem can be addressed through additional source-level tools, such as dataflow slicing, that is, determining the dataflow representation for a program, a more direct approach is to compare the executable program binaries obtained by compiling the source code into machine code which incorporates any changes such as, for example, variable format changes.
Naively comparing program binaries leads to an overwhelming number of “false positives,” or insignificant differences, since, for example, adding a line of source code will tend to induce large-scale differences in the new binary, because instruction displacements, that is, explicit distances encoded in instructions, and register assignments, which define exactly which fast hardware memory locations are used, will differ throughout the program.
An embodiment of the present invention accurately finds the different and similar portions of two binaries related by small changes, and can form a mapping between, or correlating, the similar portions, such that information pertaining to the baseline binary can be applied to the current binary.
Therefore, in accordance with the present invention, a method for determining changed code in a second program binary relative to a first or baseline program binary, where the second program is a different version of the first program, includes the step of translating machine addresses of both program binaries to symbols. The first and second program binaries are disassembled using the translated symbols. Differences between the two resulting disassemblies are determined, and a list of the differences is created.
The second program can be an updated version of the first program, or more generally, the first and second programs can simply be two different versions of a program.
Preferably, a symbol table, an address range table, and/or a control flow structure are determined for each of the program binaries, and used to translate machine addresses.
Preferably, differences between the disassemblies, which correspond to differences between the program binaries, are determined by textually comparing the disassemblies, with a utility such as the “diff” program provided by the UNIX operating system, or some other text comparison program.
Each disassembly contains a sequence of instructions, and each instruction occupies a line. For efficiency, each disassembly is preferably transformed into a sequence of “block-instructions,” where a block-instruction contains, in a single line, all of the instructions from within a block, and where a block contains a sequence of instructions which ends in a branch. The blocked-instructions from the two versions are then compared using “diff,” or a similar program or function.
The set of changed blocked-instructions thus determined can be further refined by breaking each changed blocked-instruction into its component instructions, so that each instruction occupies a line. Again using diff on the instructions within the blocks marked as changed, it is determined which instructions have changed.
Alternatively, differences between the program binaries can be determined by first determining control flow graphs of the disassemblies, and using graph-matching techniques to determine the differences between the control flow graphs.
The list of differences can be correlated to differences between the source statements, and presented to a user, for example, in printed form or on a display, or alternatively, the list can be saved in a file or passed to another process for further processing. For example, the list can be used to aid in test coverage analysis, code change analysis, or failure analysis, among other analyses.
Changes in the second version relative to the first or baseline version may result, for example, by inserting instructions into the first program, or by modifying instructions in the first program, or by deleting instructions from the first program. One change might be where a variable's size is different in the second program binary relative to the first program binary. This could result, for example, from a change in source code, or from use of a different compiler, or even from the same compiler with different options selected. Similarly, changes in the second version relative to the first version may result from a change to a data structure's definition.
In at least one embodiment, known attributes of the compiler(s) which created the program binaries can be used in translating symbols and disassembling binaries. An example is where a known attribute is a standard base register.
Machine addresses can be, but are not limited to, for example, register names, memory addresses including both virtual and physical addresses, and address offsets.
According to another aspect of the present invention, a method for analyzing changed code coverage of a second version of a program relative to a first version, includes marking code in the second program which is changed or different from the first program. The second program is then executed in a test environment, and code which is executed is marked as having been executed. Next, the second program is executed in a non-test environment, such as a production environment, and code which is executed in this second environment is marked accordingly. Finally, from the variously marked code, a list of changed code which have not executed in the test environment but have executed in the non-test environment is provided.
Code can be marked by various groupings, such as, for example, individual code lines, or basic blocks.
In certain applications, coverage results can be obtained on a production run of a baseline program and mapped to a program under test, to determine which portions of the program under test have not executed in the production environment.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.
FIG. 1 is a schematic flow diagram illustrating an embodiment of the present invention.
FIG. 2 is a schematic flow diagram illustrating an embodiment of the present invention using graph-matching techniques.
FIG. 3. is a schematic diagram illustrating, in an embodiment of the present invention, the filtering of the difference list.
FIG. 4 is a schematic flow diagram illustrating an embodiment of the present invention which analyzes changed coverage of an updated version of a program.
A description of preferred embodiments of the invention follows.
FIG. 1 is a schematic flow diagram illustrating an embodiment of the present invention. Assume that initially, source code 11, shown as a line representing a sequence of source-level instructions, exists for some program. The source code 11 can be written in a high-level language such as C, Pascal, Fortran, etc., or in a lower level language such as assembly language.
Typically, the program source 11 is processed by a compiler 25 (or an assembler if the source code is in assembly language) to produce an executable program binary 11′, comprising machine-readable instructions. The executable 11′ can then be used for testing or production, or for some other purpose.
Eventually, the program source 11 is updated, due to, for example, bug fixes, enhancements, introduction of new features, deletion of obsolete features, etc. In the illustrative example of FIG. 1, the first or baseline version 11, Version M, is updated to produce a second version 13, Version N, by inserting (step 15) one or more instructions A 19 at location X, and by replacing or modifying (step 17) instructions B 21 with instructions C 23. Note that the insertion of instructions A 19 shifts the instructions which follow, such that the C instructions 23 are at a location Y2 which is offset relative to the location Y, in the baseline program 11.
The source code 13 for Version N is then processed by the compiler 26 or assembler to produce a Version N program binary 13′. The compiler 26 may or may not be the same compiler 25 used to compile the baseline Version M program. Note that instructions A, B and C are compiled into respective binary instructions A′, B′ and C′, each of which is likely to comprise several machine instructions for each line of source code. Furthermore, the location of each compiled source line in the source code 11, 13 has a corresponding location or address in the binary code 11′, 13′. Thus lines X, Y, and Y2 in the program source codes 11, 13 correspond to addresses X′, Y1′ and Y2′ in the binaries 11′, 13′.
In addition to producing executable program code 11′, 13′, a compiler often generates a symbol table 31, 39 respectively, which is a data structure used to track names (symbols) used by the program, by recording certain information about each name. Symbol tables are described at pages 429-440 and 475-480 of Aho, Sethi and Ullman, Compilers, Principles, Techniques and Tools (1988), incorporated herein by reference in its entirety. The symbol table is sometimes included with the executable program binary.
The executable can also contain other types of “debug information,” such as information that relates binary instructions to source lines, or registers used within a given range of instructions to the source variable name.
Furthermore, compilers are capable of analyzing a program to create a control flow representation 29, 37 of the program. Alternatively, or in addition, an analyzer 27, 35 can produce a control flow representation directly from the respective binary 11′, 13′. An example of such an analyzer is described in Schooler, “A Method for Determining Program Control Flow,” U.S. Ser. No. 09/210,138, filed on Dec. 11, 1998 and incorporated by reference herein in its entirety.
The present invention seeks to discover the changes or differences between the program binaries 11′, 13′ of the different versions. In some cases, the source for one or both versions may no longer be available. Thus, the sources 11, 13 and the compilation step 25, 29 are shown inside dashed box 9 to indicate that they occur prior to the operation of the present invention.
As mentioned previously, a naive comparison of the two binaries will yield a near useless number of false differences. The key is to distinguish between those differences that are semantically significant, in terms of the inducing source code differences, and those that are not.
An insignificant difference occurs, for example, where a different register is assigned for the same purpose. All of the instructions that use the new register are impacted, yet it makes little difference which register is actually used. Another example is where the precise layout of instruction sequences, that is their location in a binary or program executable, differs. Yet another example is where the precise offset, or distance from a base location, used to address program variables by the executable instructions, differs.
On the other hand, a significant difference occurs, for example, where the data length in a memory load or store instruction is changed, from, for example, a load byte instruction in one version, to a load long word instruction in the other version. Another example is where the two versions have a different sequence of computational instructions, or where they have a different control-flow structure.
Referring again to FIG. 1, a disassembler 33, 41 converts the program binaries 11′, 13′ into human-readable assembly code, referred to herein as a disassembly 11″, 13″. Disassemblers are commonly used to disassemble binary programs to determine how the programs work when no source is available.
In the embodiment of FIG. 1, the disassemblers 33, 41, which may be the same, use the control flow representations 29, 37 and, optionally, symbol tables 31, 39 and/or debug information, obtained by the prior analysis, to translate low-level machine addresses such as “(r5)128,” i.e., the address stored in register r5 offset by 128 bytes, into higher-level symbolic addresses such as “(TCB) 128” for 128 bytes from the start of the task control block, or “(SP)12” for 12 bytes from the stack pointer. Many of these base address names, such as start of the task control block, the stack base, the stack frame base and the heap base, are known statically from a knowledge of the computer and/or the instruction set. In addition, this step uses distinguished variable addresses, for example, memory base addresses, contained in certain registers or memory locations. See, for example, Schooler, U.S. Ser. No. 09/210,138, cited above.
Each program binary is “disassembled.” A high-level disassembly, the result of converting the binary code into human-readable assembly code by a disassembly process, is then produced, eliding insignificant details such as register numbers and memory offsets, and retaining significant details such as opcodes and symbolic bases. Thus, for each machine instruction, a corresponding opcode is determined, along with a symbolic representation of any memory locations referenced, where a symbolic representation is typically some character string which serves as the name of a variable.
As can be seen from FIG. 1, each disassembly has code sections A″, B″ and C″(refs. 19″, 21″ and 23″ respectively) corresponding to the machine code sections A′, B′ and C′ respectively (refs. 19′, 21′ and 23′ respectively), which in turn correspond to source code sections A, B and C respectively (refs. 19, 21 and 23 respectively), each section having one or more instructions.
A text comparison utility 43, such as the “diff” command provided by the UNIX operating system, is then used to produce a list 45 of differences between the two disassemblies 11″, 13″. Since there is a one-to-one correspondence between instructions in the binaries 11′, 13′ and the disassembled instructions in the disassemblies 11″, 13″, the listed differences correspond to differences between the binaries.
The textual difference of the high-level disassembly for the two program versions provides the desired result: those portions that are different, and those that are the same, as well as a map from the similar portions from the baseline to the current version.
For example, the difference list 45 of FIG. 1 shows that Version N's binary 13′ contains new code A at location X′ which Version M's binary 11′ does not contain. In addition, the difference list 45 shows that Version M contains code B at location Y1′, while Version N instead contains code C at location Y2′.
For efficiency, each disassembly is preferably transformed into a sequence of “block-instructions,” where a block-instruction contains, in a single line, all of the instructions from within a block, and where a block contains a sequence of instructions which ends in a branch. The blocked-instructions from the two versions are then compared using “diff,” or a similar program or function.
The set of changed blocked-instructions thus determined can be further refined by breaking each changed blocked-instruction into its component instructions, so that each instruction occupies a line. Again using diff on the instructions within the blocks marked as changed, it is determined which instructions have changed.
This simple textual difference operation will fail if the source-level differences between the two versions are great enough. For some types of differences, more sophisticated algorithms can continue to make an effective comparison. For example, if the current version is mostly re-arranged from the baseline, but retains mostly the same computations in different order, then algorithms that solve the linear assignment problem can be used to discover the correspondence. Algorithms exist for this “linear assignment problem” See, for example, Cormen, T. H., Leiserson, C. E. and Rivest, R. L., Introduction to Algorithms, The MIT Press, 1990, incorporated herein by reference.
Sometimes, graph matching algorithms of the two control flow graphs can yield the correspondences. See Cormen, Leiserson and Rivest.
FIG. 2 illustrates such an embodiment of the present invention which uses graph-matching techniques. Each source or binary version (binary shown 11′, 13′ is analyzed and a respective control flow graph representation 51, 53 is produced for each. In this example, assume that some portion 55 of the second program graph 53 is different from the first program graph 51. The graphs 51, 53, or their representations (not shown) are compared by a graph-matching comparator 57, and a list of differences 59 is produced.
In, FIG. 3, a difference list 46, which corresponds to the list 45 of FIG. 1, or the list 59 of FIG. 2, or another list produced by another comparison technique, is filtered by one or more filter processes 47 to provide a more desirable format 49 to a user or another computer application, or to filter the information so as to provide only certain information a user wishes to see or that an application needs to use, for example, for a particular routine. Of course, no filter is necessarily required, which is equivalent to a null filter.
The final formatted and filtered list 49 or lists can then be presented to a user via a display, or a printer, or stored in a file for later use, or can be sent to another application for further processing.
One key application of the present invention is in test coverage analysis used to determine what portions of a software program have been exercised in testing. Ideally, 100% of a program should be exercised, or “covered”. In practice this is extremely difficult, for instance, because some statements are reached only in rare, exceptional circumstances.
In practice, it is desirable to focus and measure testing on the most important portions of an application. Empirically, the portions that have recently changed, and all the code impacted by those changes, deserve special attention. The binary comparison algorithm of the present invention described above points out precisely those areas.
Another way to focus testing is to concentrate on those areas of the program that are actually run in real use, or “production”. Many parts of a program, especially a larger, older program, may not in fact be used in production, since those parts relate to formats or issues no longer relevant. With the present invention, coverage results obtained on a production run of a baseline program, can be mapped to a current program under test, and determine which portions have been exercised in production, but not yet exercised in test.
FIG. 4 is a schematic flow diagram of an embodiment of the present invention for analyzing changed code coverage of the second or updated program version. At Step 101, using a disassembly listing 107 of instructions INST 0-INST 4 for the updated version, and the list 109 of differences between the two versions produced as described above, code in the second program which is changed or different from the first program is marked, as shown at 111. In this example, changed instructions are marked with a character “C”, however other markings such as flags could also be used. Code markings can be on an instruction by instruction, i.e., line by line, basis as shown, or can be based on some other grouping, for example, on a block by block basis.
At Step 103, the second program is executed in a test environment, and code which is executed is marked as having been executed, here with the character “T”, as shown at 113. The order in which the “changed,” “listed” or “run in production” markings are made can be interchanged. Similarly, marking can happen before or after the program is run in test or production.
Next, at Step 105, the second program is executed in a non-test environment, such as a production environment, and code which is executed in this environment is marked accordingly, with a “P”, as shown at 115. The information at 115 thus simultaneously indicates which instructions have changed, which have been tested, and which have been executed in a production environment.
Code can be marked by various groupings, such as, for example, individual code lines, or basic blocks. Of course, if source code is available, source lines can be shown instead of, or in addition to, the disassembled instructions.
The markings can also be shown to the user alongside the program source code. For this we make use of information such as, for example, a listing file, a symbol table, debug information, or other means, that relates the assembly instruction to source code.
In addition, or alternatively, lines of code in the second program which are impacted due to changes relative to the baseline program are similarly marked. Directly impacted lines, that is, those which are textually changed or added relative to the baseline program are marked with one mark, for example, the character “D”, while indirectly impacted lines are marked with a different mark, for example, the character “I”.
Indirectly impacted code results where the text of statement has not been changed, but where the statement itself is nevertheless impacted. For example, assume the baseline version “Version 1” and updated version (“Version 2”) of some program are as follows, the only difference being the assignment of the value 32 to variable A in Version 1, and the assignment of the value 16 to variable A in Version B:
The line “B=A+C” in Version 2 (actually in either version relative to the other) is impacted by the change in the integer declaration but is not textually changed itself. A dataflow analysis will relate the declaration of variable A to its use in the instruction “B=A+C”.
Many other software tools can benefit from binary comparison information as well. For instance, failure analysis tools can highlight changed code (relative to a baseline) that was in the path to a failure, since empirically recently-changed code is often the cause of such failures. This highlighting can guide diagnostic engineers more quickly to the root cause of a program failure.
The changed and/or impacted code is itself also useful to the user. It can also be shown to the user at a source code level on described previously, without the “test” or “production” information.
It will be apparent to those of ordinary skill in the art that methods involved in the present system for determining the degree to which changed code has been exercised may be embodied in a computer program product that includes a computer usable medium. For example, such a computer usable medium can include a readable memory device, such as a hard drive device, a CD-ROM, a DVD-ROM, or a computer diskette, having computer readable program code segments stored thereon. The computer readable medium can also include a communications or transmission medium, such as a bus or a communications link, either optical, wired, or wireless, having program code segments carried thereon as digital or analog data signals.
While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention encompassed by the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US3711863 *||Jan 21, 1972||Jan 16, 1973||Honeywell Inf Systems||Source code comparator computer program|
|US4667290||Sep 10, 1984||May 19, 1987||501 Philon, Inc.||Compilers using a universal intermediate language|
|US4694420 *||Dec 23, 1985||Sep 15, 1987||Tektronix, Inc.||Inverse assembly method and apparatus|
|US4807182 *||Mar 12, 1986||Feb 21, 1989||Advanced Software, Inc.||Apparatus and method for comparing data groups|
|US4819233 *||Apr 8, 1987||Apr 4, 1989||Westinghouse Electric Corp.||Verification of computer software|
|US4951195||Feb 1, 1988||Aug 21, 1990||International Business Machines Corporation||Condition code graph analysis for simulating a CPU processor|
|US5146586||Feb 13, 1990||Sep 8, 1992||Nec Corporation||Arrangement for storing an execution history in an information processing unit|
|US5191646||Sep 25, 1991||Mar 2, 1993||Hitachi, Ltd.||Display method in software development support system|
|US5241678||May 13, 1992||Aug 31, 1993||Hitachi, Ltd.||Program translation based on generalized partial computation|
|US5265254||Aug 14, 1991||Nov 23, 1993||Hewlett-Packard Company||System of debugging software through use of code markers inserted into spaces in the source code during and after compilation|
|US5321828||Jun 7, 1991||Jun 14, 1994||Step Engineering||High speed microcomputer in-circuit emulator|
|US5410648 *||Aug 30, 1991||Apr 25, 1995||International Business Machines Corporation||Debugging system wherein multiple code views are simultaneously managed|
|US5428786||Mar 7, 1991||Jun 27, 1995||Digital Equipment Corporation||Branch resolution via backward symbolic execution|
|US5446878||Oct 20, 1994||Aug 29, 1995||Digital Equipment Corporation||Method for selectively enabling subset of embedded event-making instructions and selecting types and items of event-based data to be collected per enabled instruction|
|US5450586 *||Apr 30, 1992||Sep 12, 1995||Hewlett-Packard Company||System for analyzing and debugging embedded software through dynamic and interactive use of code markers|
|US5488714||Aug 25, 1993||Jan 30, 1996||Unisys Corporation||Computer program analyzer for adapting computer programs to different architectures|
|US5507030 *||Mar 7, 1991||Apr 9, 1996||Digitial Equipment Corporation||Successive translation, execution and interpretation of computer program having code at unknown locations due to execution transfer instructions having computed destination addresses|
|US5546586||May 6, 1993||Aug 13, 1996||Apple Computer, Inc.||Method and apparatus for vectorizing the contents of a read only memory device without modifying underlying source code|
|US5615369||Jul 25, 1994||Mar 25, 1997||Hewlett-Packard Company||Automated detection and correction of uninitialized variables|
|US5675803||Sep 1, 1994||Oct 7, 1997||Sun Microsystems, Inc.||Method and apparatus for a fast debugger fix and continue operation|
|US5732273||Jan 3, 1997||Mar 24, 1998||Digital Equipment Corporation||System for monitoring compute system performance|
|US5732275||Jan 11, 1996||Mar 24, 1998||Apple Computer, Inc.||Method and apparatus for managing and automatically updating software programs|
|US5758061||Dec 15, 1995||May 26, 1998||Plum; Thomas S.||Computer software testing method and apparatus|
|US5764992||Jun 6, 1995||Jun 9, 1998||Apple Computer, Inc.||Method and apparatus for automatic software replacement|
|US5790858||Jun 30, 1994||Aug 4, 1998||Microsoft Corporation||Method and system for selecting instrumentation points in a computer program|
|US5802373||Jan 29, 1996||Sep 1, 1998||Digital Equipment Corporation||Method for providing a pipeline interpreter for a variable length instruction set|
|US5812855||Jun 3, 1996||Sep 22, 1998||Silicon Graphics, Inc.||System and method for constaint propagation cloning for unknown edges in IPA|
|US5870607||Sep 11, 1996||Feb 9, 1999||Brown University Research Foundation||Method and apparatus for selective replay of computer programs|
|US5946484 *||May 8, 1997||Aug 31, 1999||The Source Recovery Company, Llc||Method of recovering source code from object code|
|US5966541||Dec 4, 1997||Oct 12, 1999||Incert Software Corporation||Test protection, and repair through binary-code augmentation|
|US5978588||Jun 30, 1997||Nov 2, 1999||Sun Microsystems, Inc.||Method and apparatus for profile-based code placement using a minimum cut set of the control flow graph|
|US6018747||Nov 26, 1997||Jan 25, 2000||International Business Machines Corporation||Method for generating and reconstructing in-place delta files|
|US6071316 *||Sep 29, 1997||Jun 6, 2000||Honeywell Inc.||Automated validation and verification of computer software|
|US6138270 *||Jun 23, 1999||Oct 24, 2000||National Instruments Corporation||System, method and memory medium for detecting differences between graphical programs|
|US6151701 *||Sep 28, 1998||Nov 21, 2000||Ahpah Software, Inc.||Method for reconstructing debugging information for a decompiled executable file|
|US6202199 *||Jul 30, 1998||Mar 13, 2001||Mutek Solutions, Ltd.||System and method for remotely analyzing the execution of computer programs|
|US6282698 *||Dec 4, 1998||Aug 28, 2001||Lucent Technologies Inc.||Detecting similarities in Java sources from bytecodes|
|US6282701 *||Jul 30, 1998||Aug 28, 2001||Mutek Solutions, Ltd.||System and method for monitoring and analyzing the execution of computer programs|
|US6360359 *||Jan 27, 1999||Mar 19, 2002||Nec Corporation||Source converter processing method and machine-readable media storing it|
|US6393606 *||Jun 25, 1999||May 21, 2002||Agilent Technologies, Inc.||Inverse assembler|
|US6530044 *||Aug 31, 1998||Mar 4, 2003||Scott A. Beeker||System and disassembling test data and method|
|EP0286361A2||Apr 5, 1988||Oct 12, 1988||Westinghouse Electric Corporation||Method of verifying computer software|
|EP0372835A2||Nov 30, 1989||Jun 13, 1990||AT&T Corp.||Translation technique|
|EP0403415A2||May 29, 1990||Dec 19, 1990||International Business Machines Corporation||System and method for detecting and diagnosing errors in a computer program|
|WO1990001738A1||Jul 10, 1989||Feb 22, 1990||Hunter Systems Software, Inc.||Machine process for translating programs in binary machine language into another binary machine language|
|WO2000011549A1||Aug 18, 1999||Mar 2, 2000||Emony Ltd.||Difference extraction between two versions of data-tables containing intra-references|
|WO2000054385A1||Mar 6, 2000||Sep 14, 2000||Preview Systems, Inc.||User transparent software malfunction detection and reporting|
|1||"Instruction Trace Apparatus. Feb. 1978." IBM Technical Disclosure Bulletin, 20(9):1-3 (Feb. 1, 1978).|
|2||"Productivity Tool for Online Tracing of an Assembly LISTING Using a PER TRACE File," IBM Technical Disclosure Bulletin, (Nov. 1, 1987).|
|3||Aho, Alfred V., Compilers, Principles, Techniques, and Tools, pp. 513-580.|
|4||Aho, Alfred V., et al., Compilers-Principles, Techniques and Tools, pp. 429-440 and 475-480, Addison-Wesley Publishing Company (reprinted Mar. 1988).|
|5||Aho, Alfred V., et al., Compilers—Principles, Techniques and Tools, pp. 429-440 and 475-480, Addison-Wesley Publishing Company (reprinted Mar. 1988).|
|6||Ambras, J.P., et al., "Microscope: An Integrated Program Analysis Toolset," Hewlett-Packard Journal, 4: 71-82 (Aug. 1, 1988).|
|7||Ammons, G., and Larus, J., "Improving Data-flow Analysis with Path Profiles," ACM Sigplan Notices, US, Association for Computing Machinery, 33(5):72-84 (1998).|
|8||Anant AgarwaL, et al., "ATUM: A New technique for Capturing Address Traces Using Microcode," Proceedings of the 13th Annual Symposium on Computer Architecture, Jun. 1986.|
|9||Ball, T. and Larus, J.R., "Optimally Profiling and Tracing Programs," Technical Report #1031, Rev. 1, Computer Sciences Department, University of Wisconsin-Madison, Sep., 1991.|
|10||Ball, T. and Larus, J.R., "Optimally Profiling and Tracing Programs," Technical Report #1031, Rev. 1, Computer Sciences Department, University of Wisconsin—Madison, Sep., 1991.|
|11||Colin Hunter, et al., "DOS at RISC," Byte, Nov., 1989, pp. 361-368.|
|12||Coppieters, K., "A Cross-Platform Binary Diff," Dr. Dobb's Journal, May 1, 1995 pp. 32, 35-36.|
|13||Feldman, S.I. and Brown, C.B. "IGOR: a system for program debugging via reversible execution," Proceedings of the ACM SIGPLAN and SIGOPS Workshop on Parallel and Distributed Debugging, pp. 112-123 (1988).|
|14||Ferrante, J., et al., The Program Dependence Graph and Its Use in Optimization, pp. 320-349.|
|15||International Business Machines Corporation, Generic Methodology for Code Patching in Binary File, 802-803 (Jun., 1998).|
|16||Johnson, R., et al., Dependence-Based Program Analysis, pp. 78-89.|
|17||Kazuhito, Patch System, Patent Abstract of Japan (CD-ROM), Unexamined Applications, vol. 94, No. 11 (Nov. 8, 1994).|
|18||Larus, J.R. "Abstract Execution: A Technique for Efficiently Tracing Programs," from Software Practice & Experience, GB (Chichester, John Wiley & Sons LTD.) pp. 1241-1258 (Dec. 1, 1990).|
|19||*||Lucas, Carine, Steyaert, Patrick, Mens, Kim, "Managing Software Evolution through Reuse Contracts",Programming Technolog Lab, Vrije Universiteit Brussel, IEEE, 1997, retrieved from IEEE database Sep. 4, 2002.*|
|20||Robert C. Bedicheck, "Talisman: Fast and Accurate Multicomputer Simulation," 1985, Laboratory for Computer Science, Massachusetts Institute of Technology.|
|21||Robert C. Bedichek, "Some Efficient Architecture Simulation Techniques," Department of Computer Sciences, University of Washington, Usenix Conference, Jan., 1990.|
|22||Rosen, Kenneth H., et al., UNIX System V Release 4: An Introduction for New and Experienced Users, pp. 441-442, Osborne McGraw-Hill (1990).|
|23||*||Rothermel, Gregg and Harrold, Mary Jean, "A Safe, Efficient Regression Test Selection Technique", ACM, 1997, retrieved from the ACM database Sep. 4, 2002.*|
|24||*||Rothermel, Gregg and Harrold, Mary Jean, "Selecting Tests and Identifying Test Coverage Requirements for Modified Software",Department of Computer Science, Clemson University,ACM, 1994, retrieved from the ACM database Sep. 4, 2002.*|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6829733 *||May 7, 2001||Dec 7, 2004||National Instruments Corporation||System and method for graphically detecting differences between test executive sequence files|
|US6859894 *||Nov 30, 2001||Feb 22, 2005||Emc Corporation||System and method for risk management of errors in software program code|
|US6907308 *||Aug 2, 2002||Jun 14, 2005||Advanced Micro Devices, Inc.||Remote wafer flow and recipe editor for simiconductor processing control|
|US6954932 *||Mar 20, 2001||Oct 11, 2005||Hitachi, Ltd.||Program control system and program control method|
|US7036112 *||Aug 16, 2002||Apr 25, 2006||Sun Microsystems, Inc.||Multi-mode specification-driven disassembler|
|US7086041||Jun 27, 2003||Aug 1, 2006||Microsoft Corporation||Extensible type system for representing and checking consistency of program components during the process of compilation|
|US7120898||Jun 26, 2003||Oct 10, 2006||Microsoft Corporation||Intermediate representation for multiple exception handling models|
|US7146606||Jul 22, 2003||Dec 5, 2006||Microsoft Corporation||General purpose intermediate representation of software for software development tools|
|US7222338 *||Aug 16, 2002||May 22, 2007||Lg-Nortel, Co., Ltd.||Method for upgrading data|
|US7257804 *||Jun 13, 2002||Aug 14, 2007||Accenture Global Services Gmbh||Method of producing a software product|
|US7257805 *||Nov 9, 2001||Aug 14, 2007||International Business Machines Corporation||Restoring debugging breakpoints subsequent to program code modifications|
|US7305666||Jul 23, 2003||Dec 4, 2007||Microsoft Corporation||Description language for an extensible compiler and tools infrastructure|
|US7308680||Aug 15, 2006||Dec 11, 2007||Microsoft Corporation||Intermediate representation for multiple exception handling models|
|US7308684||Jun 16, 2003||Dec 11, 2007||Microsoft Corporation||Classifying software and reformulating resources according to classifications|
|US7343600 *||Aug 18, 2003||Mar 11, 2008||Lenovo (Singapore) Pte. Ltd.||Providing an image of installed software utilizing uninstall code|
|US7430733 *||Nov 15, 2007||Sep 30, 2008||International Business Machines Corporation||Method for validation of binary code transformations|
|US7496904||Jun 26, 2003||Feb 24, 2009||Microsoft Corporation||Mining dependencies for testing and risk management|
|US7519953 *||Sep 30, 2003||Apr 14, 2009||Microsoft Corporation||Method and system for automatically testing a software build|
|US7552361||Dec 14, 2006||Jun 23, 2009||International Business Machines Corporation||Software testing optimization apparatus and method|
|US7559050||Jun 30, 2003||Jul 7, 2009||Microsoft Corporation||Generating software development tools via target architecture specification|
|US7676506 *||May 9, 2007||Mar 9, 2010||Innopath Software, Inc.||Differential file compression of software image versions|
|US7685581||Jun 27, 2003||Mar 23, 2010||Microsoft Corporation||Type system for representing and checking consistency of heterogeneous program components during the process of compilation|
|US7707566||Jul 25, 2003||Apr 27, 2010||Microsoft Corporation||Software development infrastructure|
|US7779303 *||Feb 27, 2007||Aug 17, 2010||Cisco Technology, Inc.||Targeted regression testing|
|US7788652||Jul 21, 2003||Aug 31, 2010||Microsoft Corporation||Representing type information in a compiler and programming tools framework|
|US7788661 *||Mar 10, 2006||Aug 31, 2010||International Business Machines Corporation||Method and system for applying patches to a computer program concurrently with its execution|
|US7797684 *||Nov 4, 2005||Sep 14, 2010||Oracle America, Inc.||Automatic failure analysis of code development options|
|US7802299||Apr 9, 2007||Sep 21, 2010||Microsoft Corporation||Binary function database system|
|US7860834||Jun 23, 2004||Dec 28, 2010||Evyatar Meller||Method and system for updating versions of content stored in a storage device|
|US7958400 *||Apr 16, 2007||Jun 7, 2011||International Business Machines Corporation||Detecting unexpected impact of software changes using coverage analysis|
|US8015552 *||Jul 23, 2004||Sep 6, 2011||Green Hills Software, Inc.||Post-execution software debugger with coverage display|
|US8087006 *||May 31, 2007||Dec 27, 2011||Microsoft Corporation||Static performance analysis of software|
|US8108315 *||Jun 19, 2006||Jan 31, 2012||Hewlett-Packard Development Company, L.P.||Discovering software code subject to licenses|
|US8136101||Nov 4, 2005||Mar 13, 2012||Oracle America, Inc.||Threshold search failure analysis|
|US8145949 *||Jun 16, 2010||Mar 27, 2012||Plx Technology, Inc.||Automated regression failure management system|
|US8151260||Mar 10, 2008||Apr 3, 2012||Lenovo (Singapore) Pte. Ltd.||Method for providing an image of software installed on a computer system|
|US8271955||Jul 23, 2004||Sep 18, 2012||Green Hille Software, Inc.||Forward post-execution software debugger|
|US8302087 *||Jan 5, 2007||Oct 30, 2012||International Business Machines Corporation||Quality assurance in software systems through autonomic reliability, availability and serviceability code generation|
|US8341113||Nov 16, 2010||Dec 25, 2012||Red Bend Ltd.||Method and system for updating versions of content stored in a storage device|
|US8353056 *||Oct 30, 2007||Jan 8, 2013||Chung-Ang University Industry-Academy Cooperation Foundation||Apparatus and method for detecting program plagiarism through memory access log analysis|
|US8713684||Jan 11, 2013||Apr 29, 2014||Appthority, Inc.||Quantifying the risks of applications for mobile devices|
|US8819772||Jan 11, 2013||Aug 26, 2014||Appthority, Inc.||In-line filtering of insecure or unwanted mobile device software components or communications|
|US8898647 *||Oct 9, 2008||Nov 25, 2014||Siemens Aktiengesellschaft||Method and apparatus for test coverage analysis|
|US8914777||Aug 20, 2012||Dec 16, 2014||Green Hills Software||Forward post-execution software debugger|
|US8918881||Jan 11, 2013||Dec 23, 2014||Appthority, Inc.||Off-device anti-malware protection for mobile devices|
|US8972938 *||Nov 13, 2012||Mar 3, 2015||International Business Machines Corporation||Determining functional design/requirements coverage of a computer code|
|US9122561 *||Sep 24, 2013||Sep 1, 2015||International Business Machines Corporation||Program integration that accommodates restrictions on merge-locations|
|US9158664 *||Feb 28, 2013||Oct 13, 2015||The Mathworks, Inc.||Coverage analysis for variable size signals|
|US9207915||Nov 7, 2013||Dec 8, 2015||Infosys Limited||Methods for detecting plagiarism in software code implementing a design pattern, including detecting a design pattern implemented in the software code and creating a representation that implements program logic associated with at least one function implementing the design pattern|
|US9448792 *||Mar 14, 2013||Sep 20, 2016||Microsoft Technology Licensing, Llc||Automatic risk analysis of software|
|US9563421 *||Aug 5, 2014||Feb 7, 2017||International Business Machines Corporation||Refining data understanding through impact analysis|
|US20010049751 *||Mar 20, 2001||Dec 6, 2001||Atsushi Nakamura||Program control system and program control method|
|US20020160833 *||Oct 25, 2001||Oct 31, 2002||Lloyd David B.||Adapting a game state to be compatible with a new version of a game|
|US20020166081 *||May 7, 2001||Nov 7, 2002||Scott Richardson||System and method for graphically detecting differences between test executive sequence files|
|US20030037323 *||Aug 16, 2002||Feb 20, 2003||Lg Electronics Inc.||Method for upgrading data|
|US20030101437 *||Nov 9, 2001||May 29, 2003||International Business Machines Corporation||Restoring debugging breakpoints subsequent to program code modifications|
|US20030149970 *||Jan 23, 2002||Aug 7, 2003||Vedvyas Shanbhogue||Portable software for rolling upgrades|
|US20040034851 *||Aug 16, 2002||Feb 19, 2004||Ungar David M.||Method and apparatus for implementing a multi-mode, specification-driven disassembler|
|US20040073889 *||Oct 15, 2002||Apr 15, 2004||Baecker Thomas Peter||Method of producing a software product|
|US20040093564 *||Nov 7, 2002||May 13, 2004||International Business Machines Corporation||Method and apparatus for visualizing changes in data|
|US20040163076 *||Feb 11, 2003||Aug 19, 2004||Zayas Fernando A.||Self-identifying self-test output system|
|US20040267833 *||Jun 23, 2004||Dec 30, 2004||Evyatar Meller||Method and system for updating versions of content stored in a storage device|
|US20040268213 *||Jun 16, 2003||Dec 30, 2004||Microsoft Corporation||Classifying software and reformulating resources according to classifications|
|US20040268302 *||Aug 8, 2003||Dec 30, 2004||Microsoft Corporation||Framework for determining and exposing binary dependencies|
|US20040268307 *||Jul 21, 2003||Dec 30, 2004||Microsoft Corporation||Representing type information in a compiler and programming tools framework|
|US20040268308 *||Jun 26, 2003||Dec 30, 2004||Microsoft Corporation||Mining dependencies for testing and risk management|
|US20040268327 *||Jun 30, 2003||Dec 30, 2004||Microsoft Corporation||Generating software development tools via target architecture specification|
|US20040268328 *||Jun 27, 2003||Dec 30, 2004||Microsoft Corporation||Extensible type system for representing and checking consistency of program components during the process of compilation|
|US20040268331 *||Jul 22, 2003||Dec 30, 2004||Microsoft Corporation||General purpose intermediate representation of software for software development tools|
|US20050015673 *||Jun 27, 2003||Jan 20, 2005||Microsoft Corporation||Type system for representing and checking consistency of heterogeneous program components during the process of compilation|
|US20050022161 *||Jul 23, 2003||Jan 27, 2005||Microsoft Corporation||Description language for an extensible compiler and tools infrastructure|
|US20050044096 *||Aug 18, 2003||Feb 24, 2005||International Business Machines Corporation||Method for providing an image of software installed on a computer system|
|US20050071818 *||Sep 30, 2003||Mar 31, 2005||Microsoft Corporation||Method and system for automatically testing a software build|
|US20060184838 *||Mar 29, 2005||Aug 17, 2006||Ebay Inc.||Parallel software testing based on a normalized configuration|
|US20060242491 *||Mar 10, 2006||Oct 26, 2006||International Business Machines Corporation||Method and system for applying patches to a computer program concurrently with its execution|
|US20060242628 *||Jun 29, 2006||Oct 26, 2006||Microsoft Corporation||An extensible type system for representing and checking consistency of program components during the process of compilation|
|US20070168969 *||Nov 4, 2005||Jul 19, 2007||Sun Microsystems, Inc.||Module search failure analysis|
|US20070169004 *||Nov 4, 2005||Jul 19, 2007||Sun Microsystems, Inc.||Automatic failure analysis of code development options|
|US20070294179 *||Jun 19, 2006||Dec 20, 2007||Neal Krawetz||Discovering software code subject to licenses|
|US20080040401 *||May 9, 2007||Feb 14, 2008||Matthias Reinsch||Processing of compact functional diferences|
|US20080148247 *||Dec 14, 2006||Jun 19, 2008||Glenn Norman Galler||Software testing optimization apparatus and method|
|US20080155532 *||Mar 10, 2008||Jun 26, 2008||Lenovo (Singapore) Pte. Ltd||Method for providing an image of software installed on a computer system|
|US20080163182 *||Dec 4, 2007||Jul 3, 2008||Breault Richard E||Systems and methods for building an executable program with a low probability of failure on demand|
|US20080168432 *||Jan 5, 2007||Jul 10, 2008||Naga Arun Kumar Ayachitula||Quality assurance in software systems through autonomic reliability, availability and serviceability code generatioin|
|US20080172580 *||Jan 15, 2007||Jul 17, 2008||Microsoft Corporation||Collecting and Reporting Code Coverage Data|
|US20080172651 *||Jan 15, 2007||Jul 17, 2008||Microsoft Corporation||Applying Function Level Ownership to Test Metrics|
|US20080172652 *||Jan 15, 2007||Jul 17, 2008||Microsoft Corporation||Identifying Redundant Test Cases|
|US20080172655 *||Jan 15, 2007||Jul 17, 2008||Microsoft Corporation||Saving Code Coverage Data for Analysis|
|US20080209276 *||Feb 27, 2007||Aug 28, 2008||Cisco Technology, Inc.||Targeted Regression Testing|
|US20080250018 *||Apr 9, 2007||Oct 9, 2008||Microsoft Corporation||Binary function database system|
|US20080256393 *||Apr 16, 2007||Oct 16, 2008||Shmuel Ur||Detecting unexpected impact of software changes using coverage analysis|
|US20080301650 *||May 31, 2007||Dec 4, 2008||Microsoft Corporation||Static performance analysis of software|
|US20090133005 *||Sep 8, 2008||May 21, 2009||International Business Machines Corporation||Method for validation of binary code transformations|
|US20090183143 *||Jan 8, 2009||Jul 16, 2009||Zhong Jie Li||Method and apparatus for generating test cases of software system|
|US20100242023 *||Oct 30, 2007||Sep 23, 2010||Chung-An University Industry-Academy Cooperation Foundation||Apparatus and method for detecting program plagiarism through memory access log analysis|
|US20110093841 *||Nov 16, 2010||Apr 21, 2011||Red Bend Ltd.||Method and system for updating versions of content stored in a storage device|
|US20110197098 *||Oct 9, 2008||Aug 11, 2011||Sergey Pavlovich Sobolev||Method and apparatus for test coverage analysis|
|US20110239207 *||Jun 9, 2011||Sep 29, 2011||International Business Machines Corporation||System, method and program product for identifying differences between sets of program container files|
|US20110271252 *||Apr 28, 2010||Nov 3, 2011||International Business Machines Corporation||Determining functional design/requirements coverage of a computer code|
|US20130074039 *||Nov 13, 2012||Mar 21, 2013||International Business Machines Corporation||Determining functional design/requirements coverage of a computer code|
|US20140282406 *||Mar 14, 2013||Sep 18, 2014||Microsoft Corporation||Automatic risk analysis of software|
|US20150089476 *||Sep 24, 2013||Mar 26, 2015||International Business Machines Corporation||Program Integration that Accommodates Restrictions on Merge-Locations|
|US20150186648 *||Dec 30, 2013||Jul 2, 2015||University Of Louisiana At Lafayette||System and method for identifying and comparing code by semantic abstractions|
|US20150363198 *||Jun 16, 2014||Dec 17, 2015||Symantec Corporation||Dynamic call tracking method based on cpu interrupt instructions to improve disassembly quality of indirect calls|
|EP2273361A1 *||Jun 23, 2004||Jan 12, 2011||Red Bend Ltd.||Method and system for updating versions of content stored in a storage device|
|WO2004114130A2 *||Jun 23, 2004||Dec 29, 2004||Red Bend Ltd.||Method and system for updating versions of content stored in a storage device|
|WO2004114130A3 *||Jun 23, 2004||Apr 14, 2005||Evyatar Meller||Method and system for updating versions of content stored in a storage device|
|WO2007133559A2 *||May 9, 2007||Nov 22, 2007||Innopath Software||Processing of compact functional differences|
|WO2007133559A3 *||May 9, 2007||Sep 25, 2008||Innopath Software||Processing of compact functional differences|
|U.S. Classification||717/136, 714/37, 717/170, 714/39, 717/124, 717/154, 714/38.1|
|Mar 23, 2000||AS||Assignment|
Owner name: INCERT SOFTWARE CORPORATION, MASSACHUSETTS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WITCHEL, EMMETT;METCALF, CHRISTOPHER D.;AYERS, ANDREW E.;REEL/FRAME:010667/0236;SIGNING DATES FROM 20000210 TO 20000211
|Aug 1, 2000||AS||Assignment|
Owner name: MMC/GATX PARNTERSHIP NO.1, CALIFORNIA
Free format text: SECURITY INTEREST;ASSIGNOR:INCERT SOFTWARE CORPORATION;REEL/FRAME:011511/0100
Effective date: 20000731
|Sep 24, 2007||FPAY||Fee payment|
Year of fee payment: 4
|Feb 15, 2010||AS||Assignment|
Owner name: VERITAS SOFTWARE CORPORATION,CALIFORNIA
Free format text: ASSET PURCHASE AGREEMENT;ASSIGNOR:INCERT SOFTWARE CORPORATION;REEL/FRAME:023928/0792
Effective date: 20030730
Owner name: VERITAS OPERATING CORPORATION,CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:VERITAS SOFTWARE CORPORATION;REEL/FRAME:023928/0836
Effective date: 20000628
Owner name: SYMANTEC OPERATING CORPORATION,CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:VERITAS OPERATING CORPORATION;REEL/FRAME:023928/0877
Effective date: 20061027
|Dec 8, 2011||FPAY||Fee payment|
Year of fee payment: 8
|Jul 28, 2015||AS||Assignment|
Owner name: SYMANTEC CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SYMANTEC OPERATING CORPORATION;REEL/FRAME:036199/0642
Effective date: 20150727
|Jan 15, 2016||REMI||Maintenance fee reminder mailed|
|Jun 8, 2016||LAPS||Lapse for failure to pay maintenance fees|
|Jul 26, 2016||FP||Expired due to failure to pay maintenance fee|
Effective date: 20160608