Sciweavers

99 search results - page 7 / 20
» Proving Self-Stabilization with a Proof Assistant
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
12 years 11 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
TLCA
2005
Springer
14 years 29 days ago
Proof Contexts with Late Binding
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
Virgile Prevosto, Sylvain Boulmé
JAR
2008
124views more  JAR 2008»
13 years 7 months ago
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
Xavier Leroy, Sandrine Blazy
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
Inductive types in the Calculus of Algebraic Constructions
In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), the basis of the proof assistant Coq, can be seen as a Calculus of Algebraic Constru...
Frédéric Blanqui
ITP
2010
159views Mathematics» more  ITP 2010»
13 years 11 months ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...