Interpolation for data structures

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2006, Pages 105-116

  Kapur, Deepak ^a   Majumdar, Rupak ^b   Zarba, Calogero G ^c  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

CEGAR; Data structure verification; Interpolation

Indexed keywords

AUTOMATED ANALYSIS; DATA STRUCTURE VERIFICATION; INTERPOLANTS; SOFTWARE SYSTEMS;

ABSTRACTING; ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; INTERPOLATION;

DATA STRUCTURES;

EID: 34547272737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1181775.1181789     Document Type: Conference Paper

References (41)

1. W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, 1954.
2. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL 02, pages 1-3. ACM, 2002.
3. S. Chaki, E.M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. IEEE TSE, 30(6):388-402, 2004.
4. D.G. Clarke, J. Noble, and J.M. Potter. Simple ownership types for object containment. In ECOOP 01, pages 53-76.
5. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 00, LNCS 1855, pages 154-169. Springer, 2000.
6. W. Craig. Linear reasoning: A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic, 22(3):250-268, 1957.
7. D. Detlefs, G. Nelson, and J.B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
8. P.J. Downey. Undeciability of Presburger arithmetic with a single monadic predicate letter. Technical Report 18-72, Havard University, 1972.
9. M.C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, 1996.
10. C. Flanagan, K.R.M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In PLDI 02, pages 234-245. ACM, 2002.
11. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV 97, LNCS 1254, pages 72-83. Springer, 1997.
12. Y. Gurevich. The decision problem for standard classes. J. Symbolic Logic, 41(2), 1976.
13. J. Guttag. The specification and applicatons to programming of abstract data types. PhD thesis, University of Toronto, 1975.
14. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In POPL 04, pages 232-244. ACM, 2004.
15. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL 02, pages 58-70. ACM, 2002.
16. C.A.R. Hoare. Proof of correctness of data representations. Acta Inf., 1:271-281, 1972.
17. R. Jhala and K.L. McMillan. Interpolant-based transition relation approximation. In CAV 05, LNCS 3576, pages 39-51. Springer, 2005.
18. R. Jhala and K.L. McMillan. A practical and complete approach to predicate abstraction. In TACAS 06. Springer, 2006.
19. D. Kapur and CG. Zarba. A reduction approach to decision procedures. 2005.
20. D. Kapur and H. Zhang. An overview of rewrite rule laboratory (RRL). J. Computer and Mathematics with applications, 14(2):91-114, 1995.
21. V. Kuncak and M. Rinard. The first-order theory of sets with cardinality constraints is decidable. Technical Report CSAIL 958, MIT, 2004.
22. P. Lam, V. Kuncak, and M.C. Rinard. Hob: A tool for verifying data structure consistency. In CC 05, pages 237-241, 2005.
23. B. Liskov and S. Zilles. Programming with abstract data types. In Symp. very high level programming languages. 1974.
24. A. Mal'cev. Axiomatizable classes of locally free algebras of certain types. Sibirsk. Mat. Zh., 3:729-743, 1962.
25. K.L. McMillan. Interpolation and SAT-based model checking. In CAV 03, LNCS 2725, pages 1-13. Springer, 2003.
26. K.L. McMillan. An interpolating theorem prover. Theoretical Computer Science, 345:101-121, 2005.
27. S. McPeak and G.C. Necula. Data structure specifications via local equality axioms. In CAV 05, LNCS 3576, pages 476-490. Springer, 2005.
28. P.W. O'Hearn, H. Yang, and J.C. Reynolds. Separation and information hiding. In POPL 04. ACM, 2004.
29. D.C. Oppen. Reasoning about recursively defined data structures. J. ACM, 27(3):403-411, 1980.
30. M. Parkinson and G. Bierman. Separation logic and abstraction. In POPL 05. ACM, 2005.
31. D.L. Parnas. The secret history of information hiding. In Software pioneers: contributions to software engineering. Springer, 2002.
32. M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt. In Comptes Rendus du Premier Congrès des Mathématicienes des Pays Slaves, pages 92-101, 1929.
33. S. Sagiv, T.W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24(3):217-298, 2002.
34. A. Stump, C.W. Barret, D.L. Dill, and J. Levitt. A decision procedure for an extensional theory of arrays. In LICS 01, pages 29-37. IEEE, 2001.
35. A. Stump, C.W. Barrett, and D.L. Dill. Cvc: A cooperating validity checker. In CAV 02, LNCS 2404, pages 500-504. Springer, 2002.
36. G. Takeuti. Proof Theory. North-Holland, 1987.
37. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
38. A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Society, 42:230-265, 1936.
39. V. Weispfenning. The complexity of linear problems in fields. J. Symbolic Computation, 5(1/2):3-27, 1988.
40. CG. Zarba. Combining multisets with integers. In CADE 02, LNCS 2392, pages 363-376. Springer, 2002.
41. CG. Zarba. A quantifier elimination algorithm for a fragment of set theory involving the cardinality operator. In International Workshop on Unification, 2004. s