An Approach to Program Testing
ACM Computing Surveys (CSUR)
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Correctness-preserving program transformations
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compiler testing via symbolic interpretation
ACM '76 Proceedings of the 1976 annual conference
The current state of proving programs correct
ACM '72 Proceedings of the ACM annual conference - Volume 1
Some transformations for developing recursive programs
Proceedings of the international conference on Reliable software
Verifying programs by algebraic and logical reduction
Proceedings of the international conference on Reliable software
Program improvement by source to source transformation
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Goal-directed program transformation
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
MLISP
Correctness of two compilers for a Lisp subset
Correctness of two compilers for a Lisp subset
A program verifier
Automatically proving the correctness of translations involving optimized code.
Automatically proving the correctness of translations involving optimized code.
Conditional Expressions with Equality Tests
Journal of the ACM (JACM)
Off-line and on-line algorithms for deducing equalities
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Toward automatic debugging of compilers
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
On the correctness of transformations in compiler back-ends
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
| Hi-index | 0.00 |
A formalism is presented for obtaining a normal form to be used in representing programs for compiler testing. Examples are used to motivate the features that must be considered when developing such a formalism. It is particularly suitable for heuristically optimized code and has been successfully used in a system for proving that programs written in a subset of LISP are correctly translated to assembly language.