Minimum delta generator for program binaries

Data processing: software development – installation – and managem – Software upgrading or updating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S144000, C717S157000, C707S793000

Reexamination Certificate

active

07058941

ABSTRACT:
Implementations of this invention provide a technology for generating a minimum delta between at least two program binaries. An implementation of this invention is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation of this invention produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

REFERENCES:
patent: 5379422 (1995-01-01), Antoshenkov
patent: 5481722 (1996-01-01), Skinner
patent: 5630138 (1997-05-01), Raman
patent: 5710916 (1998-01-01), Barbara et al.
patent: 5774730 (1998-06-01), Aizikowitz et al.
patent: 5974254 (1999-10-01), Hsu
patent: 6018747 (2000-01-01), Burns et al.
patent: 6189116 (2001-02-01), Mongan et al.
patent: 6205444 (2001-03-01), Floratos et al.
patent: 6314562 (2001-11-01), Biggerstaff
patent: 6526574 (2003-02-01), Jones
patent: 6594822 (2003-07-01), Schweitz et al.
patent: 2003/0084424 (2003-05-01), Reddy et al.
patent: WO 99/04336 (1999-01-01), None
“A graph theoretic approach to scene matching”, by Laure J. Chipman, The University of Alabama in Huntsville, 1990.
“A Mechanism for Automatically and Dynamically Changing Software Components” by Katsuhisa Maruyama et al., NTT Software Libraries, 1997.
“Identifying the Semantic and Textual Differences Between Two Versions of a Program”, Horwitz, S., Proceedings of the ACM SIGPLAN Conference on Programming Langauge Design and Implementation, Jun. 20, 1990, XP 002282918, pp. 234-245.
“Efficient Algorithms for Sorting and Synchronization”, Tridgell, A., Thesis submitted for the degree of Doctor of Philosophy at the Australian National University, XP 002211283, Apr. 2000, 115 pages.
“Differential Compression: A Generalized Solution for Binary Files”, Burns, R., Thesis submitted for the degree of Master of Science in Computer Science at the University of California, XP 002211282, Dec. 1996, 69 pages.
“A Cross-Platform Binary Diff”, Coppieters, K., Dr. Dobbs Journal, May 1, 1995, XP 000601152, pp. 32,35-36.
“Efficient comparison of program slices”, Horwitz et al., ACTA Informatica, vol. 28, No. 8, 1991, pp. 713-732.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Minimum delta generator for program binaries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Minimum delta generator for program binaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum delta generator for program binaries will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3626209

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.