Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

preprint · ArXiv.org · 2007

Theorem proving support in programming language semantics

Yves Bertot

Cited by 2Open access

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.

Cite this paper

APA 7

Bertot, Y. (2007). Theorem proving support in programming language semantics. ArXiv.org. https://doi.org/10.48550/arxiv.0707.0926

MLA 9

Bertot, Yves. “Theorem proving support in programming language semantics.” ArXiv.org, 2007, https://doi.org/10.48550/arxiv.0707.0926.

Chicago

Bertot, Yves. 2007. “Theorem proving support in programming language semantics.” ArXiv.org. https://doi.org/10.48550/arxiv.0707.0926.

Harvard

Bertot, Y. (2007) ‘Theorem proving support in programming language semantics’, ArXiv.org. Available at: https://doi.org/10.48550/arxiv.0707.0926.

BibTeX
@misc{bertot2007theorem,
  title = {{Theorem proving support in programming language semantics}},
  author = {Bertot, Yves},
  journal = {ArXiv.org},
  year = {2007},
  doi = {10.48550/arxiv.0707.0926}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers