Verifying the correctness of compiler transformations on basic blocks using abstract interpretation
- 1 May 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (9) , 106-115
- https://doi.org/10.1145/115866.115877
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Automatic recognition of induction variables and recurrence relations by abstract interpretationPublished by Association for Computing Machinery (ACM) ,1990
- Fortran 8x ExplainedComputers in Physics, 1989
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- Discovering machine-specific code improvementsACM SIGPLAN Notices, 1986
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- Fixpoint approach to the theory of computationCommunications of the ACM, 1972
- The correctness of programsJournal of Computer and System Sciences, 1969
- Correctness of a compiler for arithmetic expressionsProceedings of Symposia in Applied Mathematics, 1967
- Über die Bausteine der mathematischen LogikMathematische Annalen, 1924