Proving a compiler correct: A simple approach
- 1 June 1975
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 10 (3) , 370-383
- https://doi.org/10.1016/s0022-0000(75)80007-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A flow diagram composition of Markov's normal algorithms without concluding formulasBIT Numerical Mathematics, 1973
- Equivalence of partial recursivity and computability by algorithms without concluding formulasCalcolo, 1971
- Towards a theory of semantics and compilers for programming languagesJournal of Computer and System Sciences, 1969
- Semantics of context-free languagesTheory of Computing Systems, 1968
- Letters to the editor: go to statement considered harmfulCommunications of the ACM, 1968
- Correctness of a compiler for arithmetic expressionsProceedings of Symposia in Applied Mathematics, 1967