A formal model of real-time program compilation

https://doi.org/10.1016/S0304-3975(01)00047-0Get rights and content
Under an Elsevier user license
open archive

Abstract

Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code. Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints.

Keywords

Refinement calculus
Program compilation
Program semantics
Real-time programming
Program verification

Cited by (0)