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 17:19] vkuncak |
sav07_lecture_3_skeleton [2007/03/20 17:23] vkuncak |
||
---|---|---|---|
Line 96: | Line 96: | ||
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. | 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 ==== | ==== Weakest preconditions ==== | ||
Line 101: | Line 102: | ||
While symbolic execution computes formula by going forward along the program syntax tree, weakest precondition computes formula by going backward. | While symbolic execution computes formula by going forward along the program syntax tree, weakest precondition computes formula by going backward. | ||
- | ==== Papers ==== | + | ===== 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 |