Lecture Notes in Computer Science Volume 182, 1985, pp 98-108
Date: 18 Jun 2005

Using domain algebras to prove the correctness of a compiler

* 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.