Full functional verification of linked data structures

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 349-361

  Zee, Karen ^a   Kuncak, Viktor ^b   Rinard, Martin C ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b EPFL   (Switzerland)

Author keywords

Data structure; Decision procedure; Java; Theorem prover; Verification

Indexed keywords

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTERS; DATA STORAGE EQUIPMENT; FILE ORGANIZATION; FORMAL LOGIC; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; LINGUISTICS; OPEN SYSTEMS; QUERY LANGUAGES; STRUCTURAL DESIGN; THEOREM PROVING; TREES (MATHEMATICS);

CORRECTNESS PROPERTIES; DECISION PROCEDURE; DECISION PROCEDURES; DIVERSE COLLECTIONS; EXECUTION TIMES; FIRST ORDERS; FORMAL SPECIFICATIONS; FUNCTIONAL CORRECTNESSES; FUNCTIONAL VERIFICATIONS; HASH TABLES; INTERACTIVE THEOREM PROVERS; JAVA; LAMBDA ABSTRACTIONS; LINKED DATA STRUCTURES; MEMORY CONSUMPTIONS; REASONING SYSTEMS; SOURCE CODES; SUBFORMULAS; THEOREM PROVER; TRANSITIVE CLOSURES; VERIFICATION CONDITIONS; VERIFICATION SYSTEMS; WORST CASES;

DATA STRUCTURES;

EID: 57349111788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375624     Document Type: Conference Paper

References (89)

1. The Jahob project web page, http://javaverification.org.last accessed: March 2008.
2. Verisoft project, http://www.verisoft.de, Last accessed March 2008.
3. W. Ahrendt, T. Baar, B. Beckert, R. Bubel, M. Giese, R. Hahnle, W. Menzel, W. Mostowski, A. Roth, S. Schlager, and P. H. Schmitt. The Ke Y tool. Software and System Modeling, 4:32-54, 2005.
4. K. Arkoudas, K. Zee, V. Kuncak, and M. Rinard. Verifying a rile system implementation. In ICFEM, volume 3308 of LNCS, 2004.
5. D. Aspinall. Proof general: A generic tool for proof development. In TACAS, 2000.
6. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Proc. ACM PLDI, 2001.
7. M. Balser, W. Reif, G. Schellhorn, K. Stenzel, and A. Thums. Formal system development with KIV. In FASE, number 1783 in LNCS, 2000.
8. M. Barnett, R. DeLine, M. Fähndrich, K. R. M. Leino, and W. Schulte. Verification of object-oriented programs with invariants. Journal of Object Technology, 3(6):27-56, 2004.
9. D. Basin and S. Friedrich. Combining WSIS and HOL. In Frontiers of Combining Systems 2, 2000.
10. J. Berdine, C. Calcagno, and P. W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In FMCO, 2005.
11. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development-Coq 'Art: The Calculus of Inductive Constructions. Springer, 2004.
12. D. Beyer, T. A. Henzinger, and G. Théoduloz. Lazy shape analysis. In CAV, 2006.
13. A. Bouali, S. Gnesi, and S. Larosa. The integration project for the JACK environment. Bulletin of the EATCS, (54):207-223, 1994.
14. C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard. Using first-order theorem provers in a data structure verification system. In VMCAI'07, November 2007.
15. C. Boyapati, S. Khurshid, and D. Marinov. Korat: Automated testing based on Java predicates. In ISSTA, 2002.
16. R. S. Boyer and J. S. Moore. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. In Machine Intelligence, volume 11, pages 83-124. OUP, 1988.
17. P. Chalin, C. Hurlin, and J. Kiniry. Integrating static checking and interactive verification: Supporting multiple theories and provers in verification. In VSTTE. 2005.
18. S. Chong and R. Rugina. Static analysis of accessed regions in recursive data structures. In Proc. 10th SAS, volume 2694 of LNCS. Springer, 2003.
19. L. de Moura and N. Bjørner. Efficient E-matching for SMT solvers. In CADE, 2007.
20. G. Dennis, F. Chang, and D. Jackson. Modular verification of code with SAT. In ISSTA, 2006.
21. D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report 159, COMPAQ Systems Research Center, 1998.
22. J. Dunfield. A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, 2007. CMU-CS-07-129.
23. J.-C. Filliatre. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming, 13(4):709-745, 2003.
24. C. Flanagan, K. R. M. Leino, M. Lilibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended Static Checking for Java. In ACM Conf. Programming Language Design and Implementation (PLDI), 2002.
25. C. Flanagan and J. B. Saxe. Avoiding exponential explosion: Generating compact verification conditions. In Proc. 28th ACM POPL, 2001.
26. Y. Ge, C. Barrett, and C. Tinelli. Solving quantified verification conditions using satisfiability modulo theories. In CADE, 2007.
27. M. J. C. Gordon and T. F. Melham. Introduction to HOL, a theorem proving environment for higher-order logic. Cambridge University Press, Cambridge, England, 1993.
28. B. Guo, N. Vachharajani, and D. I. August. Shape analysis with inductive recursion synthesis. In PLDI, 2007.
29. D. Haneberg, G. Schellhorn, H. Grandy, and W. Reif. Verification of Mondex electronic purses with KIV: from transactions to a security protocol. Formal Asp. Comput., 20(1):41-59, 2008.
30. J. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACAS, 1995.
31. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In 31st POPL, 2004.
32. M. Hirzel, A. Diwan, and M. Hind. Pointer analysis in the presence of dynamic class loading. In ECOOP, 2004.
33. M. Huisman. Java program verification in higher order logic with PVS and Isabelle. PhD thesis, University of Nijmegen, 2001.
34. M. Huisman, B. Jacobs, and J. van den Berg. A case study in class library verification: Java's vector class. STTT, 3(3):332-352, 2001.
35. J. Hurd. An LCF-style interface between HOL and first-order logic. In CADE-18, 2002.
36. N. Immerman, A. M. Rabinovich, T. W. Reps, S. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In Computer Science Logic (CSL), pages 160-174, 2004.
37. N. Immerman, A. M. Rabinovich, T. W. Reps, S. Sagiv, and G. Yorsh. Verification via structure simulation. In CAV, pages 281-294, 2004.
38. S. Khurshid and D. Marinov. Test Era: Specification-based testing of Java programs using SAT. Autom. Softw. Eng., 11(4):403-434, 2004.
39. V. Kuncak. Binary search trees. The Archive of Formal Proofs, http://afp.sourceforge.net/, April 2004.
40. V. Kuncak. Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology, February 2007.
41. V. Kuncak, P. Lam, and M. Rinard. Role analysis. In Annual ACM Symp. on Principles of Programming Languages (POPL), 2002.
42. V. Kuncak, P. Lam, K. Zee, and M. Rinard, Modular pluggable analyses for data structure consistency. IEEE Transactions on Software Engineering, 32(12), December 2006.
43. V. Kuncak, H. H. Nguyen, and M. Rinard. An algorithm for deciding BAPA: Boolean Algebra with Presburger Arithmetic. In CADE-20, 2005.
44. V. Kuncak, H. H. Nguyen, and M. Rinard. Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning, 2006. http://dx.doi.org/10.1007/s10817-006-9042-1.
45. V. Kuncak and M. Rinard. Existential heap abstraction entailment is undecidable. In SAS, 2003.
46. V. Kuncak and M. Rinard. Towards efficient satisfiability checking for Boolean Algebra with Presburger Arithmetic. In CADE-21, 2007.
47. S. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using smt solvers. In POPL, 2008.
48. S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In POPL, 2006.
49. P. Lam. The Hob System for Verifying Software Design Properties. PhD thesis, Massachusetts Institute of Technology, February 2007.
50. O. Lee, H. Yang, and K. Yi. Automatic verification of pointer programs using grammar-based shape analysis. In ESOP, 2005.
51. T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava, and G. Yorsh. Simulating reachability using first-order logic with applications to verification of linked data structures. In CADE-20, 2005.
52. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Int. Symp. Software Testing and Analysis, 2000.
53. C. Marché, C. Paulin-Mohring, and X. Urbain. The Krakatoa tool for certification of JAVA/JAVACARD programs annotated in JML. Journal of Logic and Algebraic Programming, 2003.
54. S. McLaughlin, C. Barrett, and Y. Ge. Cooperating theorem provers: A case study combining HOL-Light and CVC Lite. In PDPAR, volume 144(2) of ENTCS, pages 43-51, Jan. 2006.
55. S. McPeak and G. C. Necula. Data structure specifications via local equality axioms. In CAV, pages 476-490, 2005.
56. F. Mehta and T. Nipkow. Proving pointer programs in higher-order logic. In CADE-19, 2003.
57. J. Meng and L. C. Paulson. Translating higher-order problems to first-order clauses. In ESCoR: Empir. Successful Comp. Reasoning, pages 70-80, 2006.
58. A. Møller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In Programming Language Design and Implementation, 2001.
59. C. Morgan. Programming from Specifications (2nd ed.). Prentice-Hall, Inc., 1994.
60. G. Nelson. Techniques for program verification. Technical report, XEROX Palo Alto Research Center, 1981.
61. G. Nelson. Verifying reachability invariants of linked structures. In POPL, 1983.
62. H. H. Nguyen, C. David, S. Qin, and W.-N. Chin. Automated verification of shape, size and bag properties via separation logic. In VMCAI, 2007.
63. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002.
64. T. Nipkow and C. Pusch. AVL trees. The Archive of Formal Proofs, http://afp.sourceforge.net/, March 2004.
65. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th CADE, volume 607 of LNAI, pages 748-752, jun 1992.
66. A. Podelski and T. Wies. Boolean heaps. In Proc. Int. Static Analysis Symposium, 2005.
67. S. Ranise and C. Tinelli. The SMT-LIB Standard: Version 1.2. Technical report, Department of Computer Science, The University of Iowa, 2006. Available at www. SMT-LIB. org.
68. J. Reineke. Shape analysis of sets. Master's thesis, Universität des Saarlandes, Germany, June 2005.
69. M. Rinard and P. Diniz. Commutativity analysis: A new analysis technique for parallelizing compilers. TOPLAS, 19(6), Nov. 1997.
70. Robby, E. Rodriguez, M. B. Dwyer, and J. Hatcliff. Checking JML specifications using an extensible software model checking framework. STTT, 8(3), 2006.
71. A. Roth. Deduktiver Softwareentwurf am Beispiel des Java Collections Frameworks. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe, June 2002.
72. R. Rugina and M. C. Rinard. Pointer analysis for structured parallel programs. ACM Trans. Program. Lang. Syst., 25(1), 2003.
73. R. Rugina and M. C. Rinard. Symbolic bounds analysis of pointers, array indices, and accessed memory regions. ACM Trans. Program. Lang. Syst., 27(2), 2005.
74. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24(3):217-298, 2002.
75. A. Salcianu and M. Rinard. Pointer and escape analysis for multithreaded programs. In PPoPP, 2001.
76. S. Schulz. E - A Brainiac Theorem Prover. Journal of AI Communications, 15(2/3):111-126, 2002.
77. K. Sen, D. Marinov, and G. Agha. Cute: a concolic unit testing engine for c. In ESEC/SIGSOET FSE, pages 263-272, 2005.
78. A. Sobeih, V. Mahesh, D. Marinov, and J. Hou. J-Sim: An integrated environment for simulation and model checking of network protocols. In IPDPS, 2007.
79. S. Stepney, D. Cooper, and J. Woodcock. An electronic purse: Specification, refinement, and proof. Technical monograph PRG-126, Oxford University Computing Laboratory, 2000.
80. G. Sutcliffe and C. B. Suttner. The TPTP problem library: CNF release vl.2.1. Journal of Automated Reasoning, 21(2): 177-203, 1998.
81. I. Tonin. Verifying the Mondex case study: The Ke Y approach. Technical Report 2007-4, Uni. Karlsruhe, July 2007.
82. J. van der Berg and B. Jacobs. The LOOP compiler for Java and UML. Technical Report CSI-R0019, Computing Science Institute, Univ. of Nijmegen, Dec. 2000.
83. F. Vivien and M. Rinard. Incrementalized pointer and escape analysis. In Proc. ACM PLDI, June 2001.
84. C. Weidenbach. Combining superposition, sorts and splitting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume II, chapter 27, pages 1965-2013. Elsevier Science, 2001.
85. M. Wenzel. Isabelle/Isar - a versatile environment for human-readable formal proof documents. PhD thesis, Technische Universitaet Muenchen, 2002.
86. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In OOPSLA, Denver, Nov. 1999.
87. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field constraint analysis. In VMCAI, 2006.
88. T. Wies, V. Kuncak, K. Zee, A. Podelski, and M. Rinard. Verifying complex properties using symbolic shape analysis. In Heap Abstraction and Verification, 2007.
89. D. Zhu and H. Xi. Safe programming with pointers through stateful views. In PADL, 2005.