Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav07_lecture_3_skeleton [2007/03/21 10:39] vkuncak |
sav07_lecture_3_skeleton [2007/03/21 10:41] vkuncak |
||
|---|---|---|---|
| Line 127: | Line 127: | ||
| Alternative: | Alternative: | ||
| * decide that you will only loop for formulas of restricted form, as in abstract interpretation and data flow analysis (next week) | * decide that you will only loop for formulas of restricted form, as in abstract interpretation and data flow analysis (next week) | ||
| + | |||
| Line 132: | Line 133: | ||
| Suppose that we obtain (one or more) verification conditions of the form | Suppose that we obtain (one or more) verification conditions of the form | ||
| + | \begin{equation*} | ||
| + | F \rightarrow \mbox{error}=\mbox{false} | ||
| + | \end{equation*} | ||
| + | |||
| + | whose validity we need to prove. We here assume that F contains only | ||
| + | |||
| + | Note: we can check satisfiability of $F \land \mbox{error}=\mbox{true}$. | ||
| ==== Quantifier Presburger arithmetic ==== | ==== Quantifier Presburger arithmetic ==== | ||