Abstract : Abstract interpreters are tools to compute approximations for behaviors of a program. These approximations can then be used for optimisation or for error detection. In this paper, we show how to describe an abstract interpreter using the type-theory based theorem prover Coq, using inductive types for syntax and structural recursive programming for the abstract interpreter's kernel. The abstract interpreter can then be proved correct with respect to a Hoare logic for the programming language.
https://hal.inria.fr/inria-00329572
Contributor : Yves Bertot
<>
Submitted on : Monday, October 20, 2008 - 4:17:06 PM
Last modification on : Wednesday, September 12, 2018 - 1:16:37 AM
Document(s) archivé(s) le : Tuesday, September 21, 2010 - 5:32:20 PM
Yves Bertot. Structural abstract interpretation, A formal study using Coq. LERNET Summer School, Ana Bove and Jorge Sousa Pinto, Feb 2008, Piriapolis, Uruguay. ⟨inria-00329572v2⟩
