Crafting a compiler
Stack computers: the new wave
Programming from specifications
Programming from specifications
Types and invariants in the refinement calculus
Science of Computer Programming
Data refinement of predicate transformers
Theoretical Computer Science
Normal form approach to compiler design
Acta Informatica
Specifying representations of machine instructions
ACM Transactions on Programming Languages and Systems (TOPLAS)
From system F to typed assembly language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler Construction: Principles and Practice
Compiler Construction: Principles and Practice
Towards Verified Systems
Provably Correct Systems: Modelling of Communication Languages and Design of Optimized Compilers
Provably Correct Systems: Modelling of Communication Languages and Design of Optimized Compilers
Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction
Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
High Level Languages and Their Compilers
High Level Languages and Their Compilers
Multi-language, Multi-target Compiler Development: Evolution of the Gardens Point Compiler Project
JMLC '97 Proceedings of the Joint Modular Languages Conference on Modular Programming Languages
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Towards Provably Correct Code Gneration for a Hard Real-Time Programming Language
CC '94 Proceedings of the 5th International Conference on Compiler Construction
A Methodology for Compilation of High-Integrity Real-Time Programs
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Register allocation & spilling via graph coloring
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
A complete transformational toolkit for compilers
A complete transformational toolkit for compilers
Modelling program compilation in the refinement calculus
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
A Formal Basis for a Program Compilation Proof Tool
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
A theory for execution-time derivation in real-time programs
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Applying Unifying Theories Of Programming To Real-Time Programming
Journal of Integrated Design & Process Science - Applications of formal methods
| Hi-index | 5.23 |
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.