Abstractions from proofs

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 232-244

  Henzinger, Thomas A ^a   Jhala, Ranjit ^a   Majumdar, Rupak ^a   McMillan, Kenneth L ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

Counterexample analysis; Predicate abstraction; Software model checking

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INTERPOLATION; PROGRAM DIAGNOSTICS; PROGRAM PROCESSORS; RELIABILITY; SOFTWARE ENGINEERING;

COUNTEREXAMPLE ANALYSIS; CRAIG INTERPOLATION; PREDICATE ABSTRACTION; SOFTWARE MODEL CHECKING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 1442287648     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964021     Document Type: Conference Paper

References (29)

1. T. Ball, T. Millstein, and S.K. Rajamani. Polymorphic predicate abstraction. ACM Transactions on Programming Languages and Systems, 2003.
2. T. Ball and S.K. Rajamani. Personal communication.
3. T. Ball and S.K. Rajamani. Generating abstract explanations of spurious counterexamples in C programs. Technical Report MSR-TR-2002-09, Microsoft Research, 2002.
4. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL 02: Principles of Programming Languages, pages 1-3. ACM, 2002.
5. R. Bodik, R. Gupta and M.L. Soffa. Refining dataflow information using infeasible paths. In FSE 97: Foundations of Software Engineering, LNCS 1301, pages 361-377. Springer, 1997.
6. W.R. Bush, J.D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic programming errors. Software Practice and Experience, 30:775-802, 2000.
7. S. Chaki, E.M. Clarke, A. Groce, and O. Strichman. Predicate abstraction with minimum predicates. In CHARME 03: Correct Hardware Design and Verification, LNCS 2860, pages 19-34. Springer, 2003.
8. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 00: Computer-Aided Verification, LNCS 1855, pages 154-169. Springer, 2000.
9. W. Craig. Linear reasoning. J. Symbolic Logic, 22:250-268, 1957.
10. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadek. Efficiently computing static single assignment form and the program dependence graph. ACM Transactions on Programming Languages and Systems, 13:451-490, 1991.
11. M. Das, S. Lerner, M. Seigle. ESP: path-sensitive program verification in polynomial time. In PLDI 02: Programming Language Design and Implementation, pages 57-68. ACM, 2002.
12. C. Flanagan. Automatic software model checking using CLP. In ESOP 03: European Symposium on Programming, LNCS 2618, pages 189-203. Springer, 2003.
13. C. Flanagan, K.R.M. Leino, M. Lillibridge, G. Nelson, J.B. Saxe, and R. Stata. Extended static checking for Java. In PLDI 02: Programming Language Design and Implementation, pages 234-245. ACM, 2002.
14. C. Flanagan and J.B. Saxe. Avoiding exponential explosion: generating compact verification conditions. In POPL 01: Principles of Programming Languages, pages 193-205. ACM, 2001.
15. J.S. Foster, T. Terauchi, and A. Aiken. Flow-sensitive type qualifiers. In PLDI 02: Programming Language Design and Implementation, pages 1-12. ACM, 2002.
16. D. Gries. The Science of Programming. Springer, 1981.
17. T.A. Henzinger, R. Jhala, R. Majumdar, G.C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for system code. In CAV 02: Computer-Aided Verification, LNCS 2404, pages 526-538. Springer, 2002.
18. T.A. Henzinger, R. Jhala, R. Majumdar, and M.A.A. Sanvido. Extreme model checking. In International Symposium on Verification, LNCS. Springer, 2003.
19. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL 02: Principles of Programming Languages, pages 58-70. ACM, 2002.
20. J. Krajicek. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic, 62:457-486, 1997.
21. J. McCarthy and J. Painter. Correctness of a compiler for arithmetic expressions. In Proc. Symposia in Applied Mathematics. American Mathematical Society, 1967.
22. K.L. McMillan. Interpolation and SAT-based model checking. In CAV 03: Computer-Aided Verification, LNCS 2725, pages 1-13. Springer, 2003.
23. J.C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.
24. J. M. Morris. A general axiom of assignment. In Theoretical Foundations of Programming Methodology, Lecture Notes of an International Summer School, pages 25-34. D. Reidel Publishing Company, 1982.
25. M. Musuvathi, D.Y.W. Park, A. Chou, D.R. Engler, and D.L. Dill. CMC: A pragmatic approach to model checking real code. In OSDI 02: Operating Systems Design and Implementation. ACM, 2002.
26. G.C. Necula. Proof carrying code. In POPL 97: Principles of Programming Languages, pages 106-119. ACM, 1997.
27. G. Nelson. Techniques for program verification. Technical Report CSL81-10, Xerox Palo Alto Research Center, 1981.
28. P. Pudlak. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbolic Logic, 62:981-998, 1997.
29. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL 95: Principles of Programming Languages, pages 49-61. ACM, 1995.