Zap: Automated theorem proving for software analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3835 LNAI, Issue , 2005, Pages 2-22

  Ball, Thomas ^a   Lahiri, Shuvendu K ^a   Musuvathi, Madanlal ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAM LISTINGS; DATA ACQUISITION; FORMAL LOGIC; NUMERICAL ANALYSIS;

AUTOMATED THEOREM PROVERS (ATP); PROGRAM ANALYSIS; SOFTWARE VERIFICATION;

THEOREM PROVING;

EID: 33745449717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_2     Document Type: Conference Paper

References (55)

1. +02] G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A S AT-based approach for solving formulas over Boolean and linear mathematical propositions. In CADE 02: Conference on Automated Deduction, LNCS 2392, pages 195-210. Springer-Verlag, 2002.
2. [AQRX04] T. Andrews, S. Qadeer, S. K. Rajamani, and Y. Xie. Zing: Exploiting program structure for model checking concurrent software. In CONCUR 04: Concurrency Theory, LNCS 3170, pages 1-15. Springer-Verlag, 2004.
3. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
4. [BDS02] C. W. Barrett, D. L. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In CAV 02: Computer-Aided Verification, LNCS 2404, pages 236-249. Springer-Verlag, 2002.
5. [BLS02] R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In CAV 02: Computer-Aided Verification, LNCS 2404, pages 78-92. Springer-Verlag, 2002.
6. [BLS05] M. Barnett, K. Rustan M. Leino, and Wolfram Schulte. The Spec# programming system: An overview. In CASSIS 04: Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, LNCS 3362, pages 49-69. Springer-Verlag, 2005.
7. [BMMR01] T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI 01: Programming Language Design and Implementation, pages 203-213. ACM, 2001.
8. [BR01] T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN 01: SPIN Workshop, LNCS 2057, pages 103-122. Springer-Verlag, 2001.
9. [Bry86] R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
10. [BTV03] Leo Bachmair, Ashish Tiwari, and Laurent Vigneron, Abstract congruence closure. J. Autom. Reasoning, 31(2):129-168, 2003.
11. [CC77] P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In POPL 77: Principles of Programming Languages, pages 238-252. ACM, 1977.
12. [CG96] B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. In European Symposium on Algorithms, pages 349-363, 1996.
13. +00] E. 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-Verlag, 2000.
14. [CH78] P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL 78: Principles of Programming Languages, pages 84-96. ACM, 1978.
15. [CL05] B-Y. E. Chang and K. R. M. Leino. Abstract interpretation with alien expressions and heap structures. In VMCAI 05: Verification, Model Checking, and Abstract Interpretation, LNCS 3385, pages 147-163. Springer-Verlag, 2005.
16. [Cla76] L. A. Clarke. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering, 2(3):215-222, September 1976.
17. [DNS03] D. L. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical report, HPL-2003-148, 2003.
18. [FJOS03] C. Flanagan, R. Joshi, X. Ou, and J. Saxe. Theorem proving using lazy proof explication. In CAV 03: Computer-Aided Verification, LNCS 2725, pages 355-367. Springer-Verlag, 2003.
19. +02] 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.
20. +04] H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV 04: Computer Aided Verification, LNCS 3114, pages 175-188. Springer-Verlag, 2004.
21. [GM93] M. J. C. Gordon and T. F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, 1993.
22. [GS97] S. Graf and H. Saldi. Construction of abstract state graphs with PVS. In CAV 97: Computer Aided Verification, LNCS 1254, pages 72-83. Springer-Verlag, 1997.
23. [GTN04] S. Gulwani, A. Tiwari, and G. C. Necula. Join algorithms for the theory of uninterpreted functions. In FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, LNCS 3328, pages 311-323. Springer, 2004.
24. [HJMM04] T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL 04: Principles of Programming Languages, pages 232-244. ACM, 2004.
25. +04] N. Immerman, A. Rabinovich, T. Reps, S. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In CSL 04: Conference on Computer Science Logic, LNCS 3210, pages 160-174. Springer-Verlag, 2004.
26. [JMSY94] J. Jaffar, M. J. Maher, P. J. Stuckey, and H. C. Yap. Beyond finite domains. In PPCP 94: Principles and Practice of Constraint Programming, LNCS 874, pages 86-94. Springer-Verlag, 1994.
27. [Kur94] R.P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.
28. [Lag85] J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM Journal of Computing, 14(1):196-209, 1985.
29. [LBC03] S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In CAV 03: Computer-Aided Verification, LNCS 2725, pages 141-153. Springer-Verlag, 2003.
30. [LBC05] S. K. Lahiri, T. Ball, and B. Cook. Predicate abstraction via symbolic decision procedures. In CAV 05: Computer Aided Verification, LNCS 3576, pages 24-38. Springer-Verlag, 2005.
31. [LM05a] S. K. Lahiri and M. Musuvathi. An efficient decision procedure for UTVPI constraints. In FroCos 05: Frontiers of Combining Systems, LNCS 3717, pages 168-183. Springer-Verlag, 2005.
32. [LM05b] S. K. Lahiri and M. Musuvathi. An efficient Nelson-Oppen decision procedure for difference constraints over rationals. Technical Report MSR-TR-2005-61, Microsoft Research, 2005.
33. [LMO05] K. R. M. Leino, M. Musuvathi, and X. Ou. A two-tier technique for supporting quantifiers in a lazily proof-explicating theorem prover. In TAG AS 05: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 3440, pages 334-348. Springer-Verlag, 2005.
34. [LS04] S. K. Lahiri and S. A. Seshia. The UCLID decision procedure. In CAV 04: Computer Aided Verification, LNCS 3114, pages 475-478. Springer-Verlag, 2004.
35. [Mar99] P. Marquis. Consequence-finding algorithms. In Handbook of Defeasible Reasoning and Uncertainty Management Systems (vol. 5): Algorithms for Defeasible and Uncertain Reasoning, pages 41-145. Kluwer Academic Publishers, 1999.
36. [McM03] K.L. McMillan. Interpolation and SAT-based model checking. In CAV 03: Computer-Aided Verification, LNCS 2725, pages 1-13. Springer-Verlag, 2003.
37. [McM04] K.L. McMillan. An interpolating theorem prover. In TACAS 04: Tools and Algorithms for Construction and Analysis of Systems, pages 16-30. Springer-Verlag, 2004.
38. +01] M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In DAC 01: Design Automation Conference, pages 530-535. ACM Press, 2001.
39. [MS01] A. Møller and M. I. Schwartzbach. The pointer assertion logic engine. In PLDI 01: Programming Language Design and Implementation, pages 221-231. ACM Press, 2001.
40. [Nec97] G.G. Necula. Proof carrying code. In POPL 97: Principles of Programming Languages, pages 106-119. ACM, 1997.
41. [NO79a] G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS), 2(1):245-257, 1979.
42. [NO79b] G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.
43. [NO80] G. Nelson and D. C. Oppen. Fast decision procedures based on the congruence closure. Journal of the ACM, 27(2):356-364, 1980.
44. [Opp80] Derek C. Oppen. Complexity, convexity and combinations of theories. In Theoretical Computer Science, volume 12, pages 291-302, 1980.
45. [ORS92] S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In CADE 92: Conference on Automated Deduction, LNCS 607, pages 748-752. Springer-Verlag, 1992.
46. [Pra77] V. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute of Technology, Cambridge, Mass., September 1977.
47. [RA01] A. Riazanov and A.Voronkov. Vampire 1.1 (system description). In 13-CAR '01: International Joint Conference on Automated Reasoning, LNAI 2083, pages 376-380. Springer-Verlag, 2001.
48. [SB04] S. A. Seshia and R. E. Bryant. Deciding quantifier-free Presburger formulas using parameterized solution bounds. In LICS 04: Logic in Computer Science, pages 100-109. IEEE Computer Society, July 2004.
49. [SG04] S. Shoham and O. Grumberg. Monotonic abstraction-refinement for CTL. In TACAS 04: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2988, pages 546-560. Springer-Verlag, 2004.
50. [SRW99] M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In POPL 99: Principles of Programming Languages, pages 105-118. ACM, 1999.
51. [TH96] C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In FroCos 96: Frontiers of Combining Systems, Applied Logic, pages 103-120. Kluwer Academic Publishers, 1996.
52. [TS05] N. Tillmann and W. Schulte. Parameterized unit tests. In FSE 05: Foundations of Software Engineering, pages 253-262. ACM Press, 2005.
53. [YM05] G. Yorsh and M. Musuvathi. A combination method for generating interpolants. In CADE 05: Conference on Automated Deduction, LNCS 3632, pages 353-368. Springer-Verlag, 2005.
54. [YRS04] G. Yorsh, T. Reps, and M. Sagiv. Symbolically computing most-precise abstract operations for shape analysis. In TACAS 04: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2988, pages 530-545. Springer-Verlag, 2004.
55. [ZZ96] H. Zhang and J. Zhang. Generating models by SEM. In CADE 96: Conference, on Automated Deduction, LNAI 1104, pages 308-312. Springer-Verlag, 1996.