- Text
- Formula,
- Simplified,
- Else,
- Formulas,
- Constraint,
- Analysis,
- True,
- Program,
- Simplification,
- Example,
- Www.cs.wm.edu

Small Formulas for Large Programs: On-line Constraint ...

Scalability and Formula Size ● Many program analysis techniques represent program states as SAT or SMT **for**mulas. ● Queries about program => Satisfiability and validity queries to the constraint solver ● Scalability of these techniques is often very sensitive to **for**mula size.

Techniques to Limit Formula Size ● Many different techniques to control **for**mula size: ● Basic Predicate abstraction – **Formulas** are over a finite, fixed set of predicates. ● Predicate abstraction with CEGAR – Iteratively discover “relevant” predicates. ● Property simulation – Track only those path conditions where property differs along arms of the branch. ● and many others... ESP SLAM, BLAST

- Page 1: Small Formulas for Large Programs:
- Page 5 and 6: Goal #1: Non-redundancy ● Given f
- Page 7 and 8: An Example enum op_type {ADD=0, SUB
- Page 9 and 10: An Example enum op_type {ADD=0, SUB
- Page 11 and 12: Now that this example has convinced
- Page 13 and 14: Redundant Leaves ● A leaf L is no
- Page 15 and 16: Properties of Simplified Forms ●
- Page 17 and 18: Critical Constraint Idea: Compute a
- Page 19 and 20: Example ● Consider again the form
- Page 21 and 22: Example ● Consider again the form
- Page 23 and 24: Making it Practical 2n 2 ● Worst
- Page 25 and 26: Impact on Analysis Scalability Anal
- Page 27 and 28: It's not just Compass ● Measured
- Page 29: Any questions?