Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
sav08:lecture03 [2008/02/27 18:42] vkuncak |
sav08:lecture03 [2008/03/02 22:18] vkuncak |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Program Semantics, Hoare Logic ====== | ====== Program Semantics, Hoare Logic ====== | ||
| - | |||
| - | From Programs to Formulas | ||
| - | |||
| - | * [[http://lara.epfl.ch/dokuwiki/doku.php?id=sav07_lecture_2#programs_as_relations|some material from last year]] | ||
| [[Simple Programming Language]] - A Turing-complete imperative language which we will use to illustrate verification. | [[Simple Programming Language]] - A Turing-complete imperative language which we will use to illustrate verification. | ||
| Line 10: | Line 6: | ||
| [[Hoare Logic]] - Verifying programs by writing sufficient assertions in program code, Weakest Preconditions, Strongest Postconditions. | [[Hoare Logic]] - Verifying programs by writing sufficient assertions in program code, Weakest Preconditions, Strongest Postconditions. | ||
| + | |||
| + | In [[lecture04]] we will use these notions to express correctness of annotated programs using formulas. | ||