Sciweavers

56 search results - page 3 / 12
» A Declarative Language for the Coq Proof Assistant
Sort
View
POPL
2006
ACM
14 years 5 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
FOSSACS
2008
Springer
13 years 6 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo
ENTCS
2008
136views more  ENTCS 2008»
13 years 5 months ago
Multimodal Separation Logic for Reasoning About Operational Semantics
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic. A heterogeneou...
Robert Dockins, Andrew W. Appel, Aquinas Hobor
POPL
2010
ACM
14 years 2 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
PROVSEC
2007
Springer
13 years 11 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti