LARA

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
sav07_lecture_4_skeleton [2007/03/22 20:45]
vkuncak
sav07_lecture_4_skeleton [2007/03/22 23:12]
olivier.gobet
Line 8: Line 8:
  
 We use weakest preconditions,​ although you could also use strongest postconditions or any other variants of the conversion from programs to formulas. We use weakest preconditions,​ although you could also use strongest postconditions or any other variants of the conversion from programs to formulas.
- 
  
 ===== More on wp ===== ===== More on wp =====
Line 18: Line 17:
 === wp of havoc === === wp of havoc ===
  
-Can we derive wp(Q,​havoc(x)?​+Can we derive wp(Q,​havoc(x))?
   * By consider havoc(x) as (... [] x=-1 [] x = 0 [] x = 1 [] ...) ?   * By consider havoc(x) as (... [] x=-1 [] x = 0 [] x = 1 [] ...) ?
   * From relational definition?   * From relational definition?
Line 147: Line 146:
   * [[Gallier Logic Book]], Chapter 10.6   * [[Gallier Logic Book]], Chapter 10.6
   * {{nelsonoppen80decisionprocedurescongruenceclosure.pdf|the original paper by Nelson and Oppen}}   * {{nelsonoppen80decisionprocedurescongruenceclosure.pdf|the original paper by Nelson and Oppen}}
-