| 摘要 |
PROBLEM TO BE SOLVED: To provide a technology for generating a minimum delta between at least two program binaries. SOLUTION: One implementation of this invention provides a source program S in a binary format and a target program T in a binary form. Control flow graphs CFGs are constructed for the respective programs. Common blocks of the S's CFGs matched with those of T's CFGs. The blocks are matched based upon their content and their local vicinity (for example, vicinity of d). In addition, a register renaming problem is solved so that blocks can be fairly compared. This implementation 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. COPYRIGHT: (C)2007,JPO&INPIT
|
