A formal model of real-time program compilation

Theoretical Computer Science

Volumn 282, Issue 1, 2002, Pages 151-190

  Lermer, Karl ^a   Fidge, Colin ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

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

Indexed keywords

PROGRAM ASSEMBLERS; PROGRAM COMPILERS; SECURITY SYSTEMS; SEMANTICS;

REAL-TIME PROGRAMS;

COMPUTER PROGRAMMING;

EID: 0037036273     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00047-0     Document Type: Conference Paper

References (37)

1. Correctness of compiling occam to transputer code
2. Register allocation and spilling via graph coloring
3. Modelling program compilation in the refinement calculus
4. The deadline command, (special issue on Real-Time Systems)
5. Towards provably correct code generation for a hard real-time programming language
6. Data refinement of predicate transformers
7. A formal method for hard real-time programming
8. Multi-target compiler development: Evolution of the Gardens Point compiler project
9. Timing constraint analysis
10. Program compilation
11. Separating timing and calculation in real-time refinement
12. A sequential real-time refinement calculus
13. Deadlines are termination
14. Specification, verification and prototyping of an optimized compiler
15. The ProCoS approach to the design of real-time systems: Linking different formalisms
16. Refinement algebra proves correctness of compiling specifications
17. Normal form approach to compiler design
18. Compilation as refinement
19. A methodology for compilation of high-integrity real-time programs
20. Types and invariants in the refinement calculus
21. From system F to typed assembly language
22. Machine code programs are predicates too
23. Specifying representations of machine instructions
24. A lattice theoretical fixed point theorem and its application
25. A real-time refinement calculus that changes only time