Matching execution histories of program versions

We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy detection and several debugging scenarios. Unlike some static approaches for matching program versions, our approach does not require access to source code of the two program versions because dynamic histories can be collected by running instrumented versions of program binaries. We base our matching algorithm on comparison of rich program execution histories which include: control flow taken, values produced, addresses referenced, as well as data dependences exercised. In developing a matching algorithm we had two goals: producing an accurate match and producing it quickly. By using rich execution history, we are able to compare the program versions across many behavioral dimensions. The result is a fast and highly precise matching algorithm. Our algorithm first uses individual histories of instructions to ...

• Type: Conference
• Year: 2005
• Where: SIGSOFT
• Authors: Xiangyu Zhang, Rajiv Gupta
• Keywords: Precise Matching Algorithm, Program Execution Histories, Program Versions, SIGSOFT 2005, Software Engineering