Lab for Automated Reasoning and Analysis LARA

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
sav07_lecture_9 [2007/05/11 17:25]
ghid.maatouk
sav07_lecture_9 [2007/05/11 17:26] (current)
ghid.maatouk old revision restored
Line 81: Line 81:
   * [[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]]
- 
-===Tarski'​s Fixpoint Theorem=== 
  
 === Widening === === Widening ===
Line 131: Line 129:
 \end{equation*} \end{equation*}
 The function $\sigma$ improves the precision of the element of the lattice without changing its meaning. ​ Subsequent computations with these values then give more precise results. The function $\sigma$ improves the precision of the element of the lattice without changing its meaning. ​ Subsequent computations with these values then give more precise results.
- 
- 
 
sav07_lecture_9.txt · Last modified: 2007/05/11 17:26 by ghid.maatouk
 
© EPFL 2018 - Legal notice