Theorem proving support in programming language semantics

Details Theorem proving support in programming language semantics Theorem proving support in programming language semantics

2007-07-06

arxiv.org/abs/0707.0926v2

Computer Science

Logic in Computer Science

Propos\'e pour publication dans l'ouvrage \`a la m\'emoire de Gilles Kahn

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Theorem proving support in programming language semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Theorem proving support in programming language semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Theorem proving support in programming language semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90143