Formal Aspects of Computing

, Volume 6, Issue 6, pp 643–658

Specification, Verification and Prototyping of an Optimized Compiler

Formal Aspects of Computing


This paper generalizes an algebraic method for the design of a correct compiler to tackle specification and verification of an optimized compiler. The main optimization issues of concern here include the use of existing contents of registers where possible and the identification of common expressions. A register table is introduced in the compiling specification predicates to map each register to an expression whose value is held by it. We define different kinds of predicates to specify compilation of programs, expressions and Boolean tests. A set of theorems relating to these predicates, acting as a correct compiling specification, are presented and an example proof within the refinement algebra of the programming language is given. Based on these theorems, a prototype compiler in Prolog is produced.


Program compilation Code optimization Formal verification Refinement algebra Logic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 1994

Authors and Affiliations

  1. 1.Oxford University Computing LaboratoryProgramming Research GroupOxfordUK

Personalised recommendations