LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
sav08:lecture02 [2008/02/21 11:48]
vkuncak
sav08:lecture02 [2008/10/11 18:42]
vkuncak
Line 1: Line 1:
-====== Lecture 2: Background, Program Semantics and Hoare Logic ======+====== Lecture 2: More Background ======
  
 Continuing from [[Lecture01]] Continuing from [[Lecture01]]
- 
-===== More Background and Its Role in This Class ===== 
  
 [[Predicate Logic Informally]] - We build on propositional logic from last lecture to explain first-order predicate logic. [[Predicate Logic Informally]] - We build on propositional logic from last lecture to explain first-order predicate logic.
Line 17: Line 15:
 [[Sets and Relations]] - Some more background in preparation for program semantics. [[Sets and Relations]] - Some more background in preparation for program semantics.
  
-===== From Programs to Formulas: Semantics and Hoare Logic ===== +===== References ​=====
- +
-  * [[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. +
- +
-[[Relational Semantics]] - Specifying meaning of programs using relations, their composition,​ union and transitive closure. +
- +
-[[Hoare Logic]] - Verifying programs by writing sufficient assertions in program code. +
  
 +  * [[Discrete mathematics by Rosen]]