A formal model of real-time program compilation

@article{Lermer2002AFM,
  title={A formal model of real-time program compilation},
  author={K. Lermer and C. Fidge},
  journal={Theor. Comput. Sci.},
  year={2002},
  volume={282},
  pages={151-190}
}
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. 
3 Citations
A Formal Basis for a Program Compilation Proof Tool
  • 5
Compilation by Refinement for a Practical Assembly Language
  • 3
An algebraic approach to the design of compilers for object-oriented languages
  • 11
  • PDF

References

SHOWING 1-10 OF 47 REFERENCES
A Formal Method for Hard Real-Time Programming
  • 9
Modelling program compilation in the refinement calculus
  • 7
  • PDF
A real-time refinement calculus that changes only time
  • 33
  • PDF
A sequential real-time refinement calculus
  • 53
  • PDF
Deadlines are termination
  • 20
  • PDF
Types and Invariants in the Refinement Calculus
  • 22
Types and Invariants in the Refinement Calculus
  • 28
...
1
2
3
4
5
...