Sciweavers

ITP
2010
161views Mathematics» more  ITP 2010»
14 years 3 months ago
Separation Logic Adapted for Proofs by Rewriting
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
Magnus O. Myreen
ITP
2010
118views Mathematics» more  ITP 2010»
14 years 3 months ago
Formal Proof of a Wave Equation Resolution Scheme: The Method Error
Abstract. Popular finite difference numerical schemes for the resolution of the one-dimensional acoustic wave equation are well-known to be convergent. We present a comprehensive...
Sylvie Boldo, François Clément, Jean...
ITP
2010
142views Mathematics» more  ITP 2010»
14 years 3 months ago
Inductive Consequences in the Calculus of Constructions
Daria Walukiewicz-Chrzaszcz, Jacek Chrzaszcz
ITP
2010
155views Mathematics» more  ITP 2010»
14 years 3 months ago
A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture
Abstract. This paper presents a new HOL4 formalization of the current ARM instruction set architecture, ARMv7. This is a modern RISC architecture with many advanced features. The f...
Anthony C. J. Fox, Magnus O. Myreen
ITP
2010
137views Mathematics» more  ITP 2010»
14 years 3 months ago
Importing HOL Light into Coq
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
Chantal Keller, Benjamin Werner
ITP
2010
156views Mathematics» more  ITP 2010»
14 years 3 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
ITP
2010
163views Mathematics» more  ITP 2010»
14 years 3 months ago
Fast LCF-Style Proof Reconstruction for Z3
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
Sascha Böhme, Tjark Weber
ITP
2010
159views Mathematics» more  ITP 2010»
14 years 3 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 ...