Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav07_lecture_3 [2007/03/30 21:52] vkuncak |
sav07_lecture_3 [2007/04/11 13:51] vkuncak |
||
|---|---|---|---|
| Line 135: | Line 135: | ||
| Note: when proving our verification condition, instead of proving that semantics of relation implies error=false, it's same as proving that the formula for set sp(U,r) implies error=false, where U is the universal relation, or, in terms of formulas, computing the strongest postcondition of formula 'true'. | Note: when proving our verification condition, instead of proving that semantics of relation implies error=false, it's same as proving that the formula for set sp(U,r) implies error=false, where U is the universal relation, or, in terms of formulas, computing the strongest postcondition of formula 'true'. | ||
| + | |||
| ==== Weakest preconditions ==== | ==== Weakest preconditions ==== | ||
| Line 208: | Line 209: | ||
| Proof: small model theorem. | Proof: small model theorem. | ||
| + | |||
| Line 263: | Line 265: | ||
| * [[http://www.cs.nyu.edu/acsys/cvc3/download.html|CVC3]] (successor of CVC Lite) | * [[http://www.cs.nyu.edu/acsys/cvc3/download.html|CVC3]] (successor of CVC Lite) | ||
| * [[http://combination.cs.uiowa.edu/smtlib/|SMT-LIB]] Standard for formulas, competition | * [[http://combination.cs.uiowa.edu/smtlib/|SMT-LIB]] Standard for formulas, competition | ||
| + | * [[http://doi.acm.org/10.1145/135226.135233|Omega test]] conjunctions of integer inequalities | ||
| ==== Full Presburger arithmetic ==== | ==== Full Presburger arithmetic ==== | ||