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_skeleton [2007/03/20 14:58] vkuncak |
sav07_lecture_3_skeleton [2007/03/20 17:23] vkuncak |
||
|---|---|---|---|
| Line 71: | Line 71: | ||
| when c is a basic command. | when c is a basic command. | ||
| + | |||
| Line 92: | Line 93: | ||
| We can apply these rules to reduce the size of formulas. | We can apply these rules to reduce the size of formulas. | ||
| - | ==== Papers ==== | + | ==== Symbolic execution ==== |
| + | |||
| + | Symbolic execution converts programs into formulas by going forward. It is therefore somewhat analogous to the way an [[interpreter]] for the language would work. It is based on the notion of strongest postcondition. | ||
| + | |||
| + | |||
| + | ==== Weakest preconditions ==== | ||
| + | |||
| + | While symbolic execution computes formula by going forward along the program syntax tree, weakest precondition computes formula by going backward. | ||
| + | |||
| + | ===== Proving quantifier-free linear arithmetic formulas ===== | ||
| + | |||
| + | ===== Papers ===== | ||
| * Verification condition generation in Spec#: http://research.microsoft.com/~leino/papers/krml157.pdf | * Verification condition generation in Spec#: http://research.microsoft.com/~leino/papers/krml157.pdf | ||