Discovering affine equalities using random interpretation
- 15 January 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 38 (1) , 74-84
- https://doi.org/10.1145/604131.604138
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Dynamically discovering likely program invariants to support program evolutionIEEE Transactions on Software Engineering, 2001
- Detecting races in Relay Ladder Logic programsInternational Journal on Software Tools for Technology Transfer, 2000
- Translation validation for an optimizing compilerPublished by Association for Computing Machinery (ACM) ,2000
- Partial online cycle elimination in inclusion constraint graphsPublished by Association for Computing Machinery (ACM) ,1998
- Detecting equality of variables in programsPublished by Association for Computing Machinery (ACM) ,1988
- Global value numbers and redundant computationsPublished by Association for Computing Machinery (ACM) ,1988
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Equivalence of free boolean graphs can be decided probabilistically in polynomial timeInformation Processing Letters, 1980
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977