Fifty years ago, John McCarthy and James Painter published the first paper on compiler verification, in which they showed how to formally prove the correctness of a compiler that translates arithmetic expressions into code for a register-based machine. In this article, we revisit this example in a modern context, and show how such a compiler can now be calculated directly from a specification of its correctness using simple equational reasoning techniques.
|Journal||Journal of Functional Programming|
|Number of pages||11|
|Publication status||Published - 20 Sep 2017|
- program calculation
- verified compiler
- virtual machine
- equational reasoning