Using domain algebras to prove the correctness of a compiler

  • Peter Dybjer
Conference paper

DOI: 10.1007/BFb0023999

Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)
Cite this paper as:
Dybjer P. (1985) Using domain algebras to prove the correctness of a compiler. In: Mehlhorn K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg

Abstract

Domain algebras are proposed as a tool for structuring compiler correctness proofs which are based on denotational semantics of the source and target language. The correctness of a compiler for a small imperative language is proved as an illustration.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Peter Dybjer
    • 1
  1. 1.Programming Methodology Group Department of Computer SciencesChalmers University of TechnologyGöteborgSweden

Personalised recommendations