Toward compiler implementation correctness proofs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transputer instruction set: a compiler writer's guide
Transputer instruction set: a compiler writer's guide
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Designing programs that check their work
Journal of the ACM (JACM)
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Communications of the ACM
Toward a theory of test data selection
Proceedings of the international conference on Reliable software
Compiler verification: a bibliography
ACM SIGSOFT Software Engineering Notes
Towards the Formal Verification of a C0 Compiler: Code Generation and Implementation Correctnes
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
On trojan horses of thompson-goerigk-type, their generation, intrusion, detection and prevention
Concurrency, Compositionality, and Correctness
| Hi-index | 0.01 |
We give a comprehensive technical overview of our work on rigorous verification of compiling specification and compiler implementation of an initial correct binary compiler executable. We will concentrate on implementation verification. Machine program correctness is proved by a special bootstrapping technique with à posteriori code inspection. Our contribution is to perform this work for compilers and, hence, to relieve the application programmer's burden to prove implementation correctness again and again, as this is done today for safety and security critical applications. Once our work has been finished conscientiously and is accepted to reach sufficient mathematical certainty, compilers may be used for proved correct program implementation, safely in the sense that every result a target program execution returns is guaranteed to be correct with respect to the source program semantics.