Dougherty, Daniel J.
Paffenroth, Randy Clinton
Symbolic analysis of a program involves the evaluation of assembly instructions with arguments that aren’t specific constants, but instead symbolic values defined by Constraints. As instructions are executed symbolically, these constraints areupdated to reflect restrictions on what values a variable can hold, and how different variables relate to one another. On some level, the constraints upon the state of the program are a reflection of its behavior, capturing the relation between inputs and outputs as a complex mathematical expression. By using a modification of existing Frequent Pattern Mining techniques, it is possible to find repeating structures in these constraints, and from them discover characteristics of the original program’s behavior. In this report we present...
Worcester Polytechnic Institute
Major Qualifying Project
All authors have granted to WPI a nonexclusive royalty-free license to distribute copies of the work, subject to other agreements. Copyright is held by the author or authors, with all rights reserved, unless otherwise noted.
Your accessibility may vary due to other restrictions.