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

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

Our Approach ● A**for**ementioned approaches control **for**mula size by restricting the set of facts that are tracked by the analysis. ● We attack the problem from a different angle: Instead of aggressively restricting which facts to track apriori, our focus is to guarantee nonredundancy of **for**mulas via constraint simplification.

Goal #1: Non-redundancy ● Given **for**mula F, we want to find **for**mula F' such that: ● F' is equivalent to F ● F' has no redundant subparts ● F' is no larger than F Such a **for**mula is in simplified **for**m ● If F is a **for**mula characterizing program property P, then predicates irrelevant to P are not mentioned in F'. – No need to guess in advance which facts/predicates may be needed later to prove P.

- Page 1 and 2: Small Formulas for Large Programs:
- Page 3: Techniques to Limit Formula Size
- 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?