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
Next revision Both sides next revision
sav07_lecture_3_skeleton [2007/03/20 17:23]
vkuncak
sav07_lecture_3_skeleton [2007/03/20 17:34]
vkuncak
Line 2: Line 2:
  
 ===== Converting programs (with simple values) to formulas ===== ===== Converting programs (with simple values) to formulas =====
 +
  
  
Line 13: Line 14:
 <​latex>​ <​latex>​
 \{((x_0,​y_0),​(x,​y)) \mid F \} \{((x_0,​y_0),​(x,​y)) \mid F \}
-</​latex> ​     +</​latex>​ 
 where F is some formula that has x,y,x_0,y_0 as free variables. where F is some formula that has x,y,x_0,y_0 as free variables.
  
Line 104: Line 106:
 ===== Proving quantifier-free linear arithmetic formulas ===== ===== Proving quantifier-free linear arithmetic formulas =====
  
-==== Papers ====+===== 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