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 Both sides next revision
sav07_lecture_9_skeleton [2007/04/17 15:14]
vkuncak
sav07_lecture_9_skeleton [2007/04/17 15:15]
vkuncak
Line 78: Line 78:
   * [[http://​www.di.ens.fr/​~cousot/​COUSOTpapers/​POPL77.shtml|Abstract interpretation]]   * [[http://​www.di.ens.fr/​~cousot/​COUSOTpapers/​POPL77.shtml|Abstract interpretation]]
   * [[http://​www.di.ens.fr/​~cousot/​COUSOTpapers/​POPL79.shtml|Systematic Design of Program Analysis Frameworks]]   * [[http://​www.di.ens.fr/​~cousot/​COUSOTpapers/​POPL79.shtml|Systematic Design of Program Analysis Frameworks]]
 +
  
  
Line 89: Line 90:
 Section 5.4: A remark on notation: Section 5.4: A remark on notation:
   * if $\rho$ denotes the state and $S$ is a deterministic statement, then $[\![S]\!]^s(\rho)$ represents the new state after executing the statement; the relation corresponding to statement semantics would be $\{(S,​[\![S]\!]^s(\rho)) \mid \rho \mbox{ is a state, mapping variables to their values \}$.   * if $\rho$ denotes the state and $S$ is a deterministic statement, then $[\![S]\!]^s(\rho)$ represents the new state after executing the statement; the relation corresponding to statement semantics would be $\{(S,​[\![S]\!]^s(\rho)) \mid \rho \mbox{ is a state, mapping variables to their values \}$.
-  * this function is extended to map sets of states to sets of states, which gives function ​ampping ​$E$ to $[\![S]\!]^c(E)$ and is what we called strongest postcondition $sp(S,E)$.+  * this function is extended to map sets of states to sets of states, which gives function ​mapping ​$E$ to $[\![S]\!]^c(E)$ and is what we called strongest postcondition $sp(S,E)$. 
 +  * this is abstracted to abstract domain
  
 === The Octagon Abstract Domain === === The Octagon Abstract Domain ===