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_4_skeleton [2007/03/22 20:43] vkuncak |
sav07_lecture_4_skeleton [2007/03/22 20:45] vkuncak |
||
|---|---|---|---|
| Line 65: | Line 65: | ||
| Benefit: if there is x_{n+1} that is not changed, we do not need to write its properties in the loop invariant. This can make loop invariant shorter. | Benefit: if there is x_{n+1} that is not changed, we do not need to write its properties in the loop invariant. This can make loop invariant shorter. | ||
| + | |||
| ==== References about weakest precondition (in construction) ==== | ==== References about weakest precondition (in construction) ==== | ||
| + | * (some online references will come here) | ||
| * Back, Wright: Refinement Calculus | * Back, Wright: Refinement Calculus | ||
| - | * Dijkstra | + | * Edsger W. Dijkstra: A Discipline of Programming |
| - | * Hoare, He | + | * C. A. R. Hoare, He Jifeng: Unifying Theories of Programming |
| ===== Modeling data structures ===== | ===== Modeling data structures ===== | ||