A formal model of real-time program compilation

DOI10.1016/S0304-3975(01)00047-0zbMath0997.68024OpenAlexW2040539243MaRDI QIDQ1603710

Karl Lermer, Colin J. Fidge

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00047-0

zbMATH Keywords

refinement calculusprogram semanticsprogram verificationreal-time programmingprogram compilation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)

Related Items (3)

An algebraic approach to the design of compilers for object-oriented languages ⋮ Unnamed Item ⋮ A theory for execution-time derivation in real-time programs

Uses Software

• TALx86

Cites Work

• Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
• Types and invariants in the refinement calculus
• Data refinement of predicate transformers
• Normal form approach to compiler design
• Specification, verification and prototyping of an optimized compiler
• A lattice-theoretical fixpoint theorem and its applications
• An Algebraic Approach to Compiler Design
• Refinement Calculus
• A sequential real-time refinement calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal model of real-time program compilation