Discovering affine equalities using random interpretation

ACM SIGPLAN Notices

Volumn 38, Issue 1, 2003, Pages 74-84

  Gulwani, Sumit ^a   Necula, George C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Affine relationships; Linear equalities; Random interpretation; Randomized algorithm

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; FORMAL LOGIC; RANDOM PROCESSES; SEMANTICS; SOFTWARE ENGINEERING;

RANDOMIZED ALGORITHM; VALIDATION; VARIABLES; VERIFICATION;

COMPUTATIONAL COMPLEXITY;

EID: 1442265542     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/640128.604138     Document Type: Article

References (14)

1. A. Aiken, M. Fähndrich, and Z. Su. Detecting races in relay ladder logic programs. International Journal on Software Tools for Technology Transfer, 3(1):93-105, 2000.
2. B. Alpern, M. Wegman, and F. Zadeck. Detecting equality of variables in programs. In Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 1-11, Jan. 1988.
3. M. Blum, A. Chandra, and M. Wegman. Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters, 10:80-82, 1980.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pages 234-252, 1977.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th ACM Symposium on Principles of Programming Languages, pages 84-97, 1978.
6. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering, 27(2):1-25, Feb. 2001.
7. M. Fähndrich, J. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 85-96, Montreal, CA, June 1998.
8. D. Hamlet. Random testing. In J. Marcianiak, editor, Encyclopedia of Software Engineering, pages 970-978. Wiley, New York, 1994.
9. M. Karr. Affine relationships among variables of a program. In Acta Informatica, pages 133-151. Springer, 1976.
10. G. C. Necula. Translation validation for an optimizing compiler. In ACM SIGPLAN '00 Conference on Programming Language Design and Implementation (PDLI), pages 83-94, Vancouver, BC, Canada, 18-21 June 2000. ACM SIGPLAN.
11. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In B. Steffen, editor, Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS '98, volume LNCS 1384, pages 151-166. Springer, 1998.
12. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In POPL '88. Proceedings of the conference on Principles of programming languages, pages 12-27, Jan. 1988.
13. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. JACM, 27(4):701-717, Oct. 1980.
14. M. Wegman, V. C. Sreedhar, and R. Bodik. Probabilistic value numbering. Unpublished manuscript, 2001.