Sciweavers

159 search results - page 1 / 32
» Structural abstract interpretation, A formal study using Coq
Sort
View
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 5 months ago
Structural abstract interpretation, A formal study using Coq
al abstract interpretation A formal study using Coq Yves Bertot INRIA Sophia-M
Yves Bertot
PPDP
2007
Springer
13 years 11 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
TPHOL
2002
IEEE
13 years 9 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
FORTE
2011
12 years 8 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
JSC
2002
84views more  JSC 2002»
13 years 4 months ago
A Constructive Algebraic Hierarchy in Coq
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
Herman Geuvers, Randy Pollack, Freek Wiedijk, Jan ...