Theorem proving support in programming language semantics

Yves Bertot 1
1 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verification condition generator and a static analyser that can be run inside the theorem prover for use in reflective proofs. Extraction of an interpreter from the denotational semantics is also described. All different aspects are formally proved sound with respect to the natural semantics specification.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/inria-00160309
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, July 10, 2007 - 10:09:17 AM
Last modification on : Wednesday, September 12, 2018 - 1:16:39 AM
Long-term archiving on : Tuesday, September 21, 2010 - 1:39:08 PM

Files

RR-6242.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00160309, version 2
  • ARXIV : 0707.0926

Collections

Citation

Yves Bertot. Theorem proving support in programming language semantics. [Research Report] RR-6242, INRIA. 2007, pp.23. ⟨inria-00160309v2⟩

Share

Metrics

Record views

884

Files downloads

594