Using first-order theorem provers in the jahob data structure verification system

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

Volumn 4349 LNCS, Issue , 2007, Pages 74-88

  Bouillaguet, Charles ^a   Kuncak, Viktor ^b   Wies, Thomas ^c   Zee, Karen ^b   Rinard, Martin ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ERROR ANALYSIS; INFORMATION ANALYSIS; JAVA PROGRAMMING LANGUAGE; THEOREM PROVING;

DATA STRUCTURE OPERATIONS; GENERIC EQUALITY OPERATOR; RESOLUTION-BASED THEOREM PROVERS; RUN TIME ERRORS;

MODEL CHECKING;

EID: 34547203542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_5     Document Type: Conference Paper

References (23)

1. K. Arkoudas, K. Zee, V. Kuncak, and M. Rinard. Verifying a file system implementation. In Sixth International Conference on Formal Engineering Methods (ICFEM'04), volume 3308 of LNCS, Seattle, Nov 8-12, 2004 2004.
2. H. P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Vol. II. Oxford University Press, 2001.
3. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In CASSIS: Int. Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart devices, 2004.
4. C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard. On using first-order theorem provers in a data structure verification system. Technical Report MITCSAIL-TR-2006-072, MIT, November 2006. http://hdl.handle.net/1721.1/ 34874.
5. W.-P. de Roever and K. Engelhardt. Data Refinement: Model-oriented proof methods and their comparison. Cambridge University Press, 1998.
6. J. Hurd. An LCF-style interface between HOL and first-order logic. In CADE-18, 2002.
7. V. Kuncak. Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology, February 2007.
8. 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.
9. K. R. M. Leino and P. Müller. A verification methodology for model fields. In ESOP'06, 2006.
10. 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.
11. M. Manzano. Extensions of First-Order Logic. Cambridge University Press, 1996.
12. J. Meng and L. C. Paulson. Experiments on supporting interactive proof using resolution. In IJCAR, 2004.
13. J. Meng and L. C. Paulson. Lightweight relevance filtering for machine-generated resolution problems. In ESCoR: Empirically Successful Computerized Reasoning, 2006.
14. J. Meng and L. C. Paulson. Translating higher-order problems to first-order clauses. In ESCoR: Empir. Successful Comp. Reasoning, pages 70-80, 2006.
15. 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.
16. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002.
17. J. Reineke. Shape analysis of sets. Master's thesis, Universität des Saarlandes, Germany, June 2005.
18. R. Rugina. Quantitative shape analysis. In Static Analysis Symposium (SAS'04), 2004.
19. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24(3):217-298, 2002.
20. S. Schulz. E-A Brainiac Theorem Prover. Journal of AI Communications, 15(2/3):111-126, 2002.
21. G. Sutcliffe and C. B. Suttner. The tptp problem library: Cnf release v1.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
22. 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.
23. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field constraint analysis. In Proc. Int. Conf. Verification, Model Checking, and Abstract Interpratation, 2006.