Communications of the ACM
Toward compiler implementation correctness proofs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate calculus and program semantics
Predicate calculus and program semantics
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Normal form approach to compiler design
Acta Informatica
VLISP: a verified implementation of Scheme
Lisp and Symbolic Computation
Piton: a mechanically verified assembly-level language
Piton: a mechanically verified assembly-level language
Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction
Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction
| Hi-index | 0.02 |
We prove the correctness of the translation of a prototypic While-language with nested, parameterless procedures to an abstract assembler language with finite stacks. A variant of the well-known wp and wlp predicate transformers, the weakest relative precondition transformer wrp, together with a symbolic approach for describing semantics of assembler code allows us to explore assembler programs in a manageable way and to ban finiteness from the scene early.