Structural comparison of executable objects

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P 46, Issue , 2004, Pages 161-173

  Flake, Halvar ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL DATA; EXECUTABLE FILES; PROGRAMMATIC CHANGES; SECURITY VULNERABILITIES; STRUCTURAL COMPARISON;

SET THEORY;

EID: 85066822149     PISSN: 16175468     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Jeffrey D. Ullmann Alfred V. Aho, Ravi Sethi. Compilerbau. Oldenburg Verlag, München Wien, 2 edition, 1999.
2. Brenda S. Baker and Udi Manber. Deducing Similarities in Java Sources from Bytecodes. pages 179-190, 1998.
3. Brenda S.Baker, Udi Manber and Robert Muth. Compressing Differences of Executable Code. In ACMSIGPLAN Workshop on Compiler Support for System Software (WCSS), pages 1-10, 1999.
4. DataRescue. IDA Pro Disassembler http://www.datarescue.com/idabase.
5. Daniel S. Hirschberg. Algoritms for the Longest Common Subsequence Problem. J. ACM, 24(4):664-675, 1977.
6. James W. Hunt and Thomas G. Szymanski. A fast algorithm for computing longest common susequences. Commun. ACM, 20(5):350-353, 1977.
7. Pocket Soft Inc. RTPatch - Software Update Tool http://www.pocketsoft.com/whitepapers/whitepaper.html.
8. Todd Sabin. Comparing binaries with graph isomorphisms http://razor.bindview.com/publish/papers/comparing-binaries.html.
9. Scott McFarling Zheng Wang, Ken Pierce. BMAT - A Binary Matching Tool. 2nd ACM Workshop on Feedback-Directed Optimization, November 1999.
10. Scott McFarling Zheng Wang, Ken Pierce. BMAT - A Binary Matching Tool for Stale Profile Propagation. The Journal of Instruction-Level Parallelism (JILP), 2, May 2000.