Chapter

STACS 85

Volume 182 of the series Lecture Notes in Computer Science pp 98-108

Date:

Using domain algebras to prove the correctness of a compiler

  • Peter DybjerAffiliated withProgramming Methodology Group Department of Computer Sciences, Chalmers University of Technology

* Final gross prices may vary according to local VAT.

Get Access

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.