Interpreter verification for a functional language

Manfred Broy, Ursula Hinkel, Tobias Nipkow, Christian Prehofer, Birgit Schieder

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Starting from a denotational and a term-rewriting based operational semantics (an interpreter) for a small functional language, we present a correctness proof of the interpreter w.r.t. the denotational semantics. The complete proof has been formalized in the logic LCF and checked with the theorem prover Isabelle. Based on this proof, conclusions for mechanical theorem proving in general are drawn.

Original languageEnglish
Title of host publicationFoundations of Software Technology and Theoretical Computer Science - 14th Conference, 1994, Proceedings
EditorsP.S. Thiagarajan
PublisherSpringer Verlag
Pages77-88
Number of pages12
ISBN (Print)9783540587156
DOIs
StatePublished - 1994
Event14th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1994 - Madras, India
Duration: 15 Dec 199417 Dec 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume880 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1994
Country/TerritoryIndia
CityMadras
Period15/12/9417/12/94

Fingerprint

Dive into the research topics of 'Interpreter verification for a functional language'. Together they form a unique fingerprint.

Cite this