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

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

Constructing Critical **Constraint** ● Assume we represent **for**mula as a tree. ● The critical constraint **for** root is true. ● Let N be any nonroot node with parent P and i'th sibling S(i). ● If P is an AND connective: ● If P is an OR connective:

Example ● Consider again the **for**mula: x = y ^ (f(x) = 1 _ (f(y) = 1 ^ x + y · 1)) f(x) = 1 _ (f(y) = 1 ^ x + y · 1) x = y ^ (f(y) 6= 1 _ x + y > 1) true x = y x = y ^ f(x) 6= 1 ^ x + y · 1 x = y ^ f(x) 6= 1 false

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