Decision procedures for algebraic data types with abstractions

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 199-210

  Suter, Philippe ^a   Dotta, Mirco ^a   Kuncak, Viktor ^a  

^a EPFL   (Switzerland)

Author keywords

Algebraic data type; Catamorphism; Data structure; Decision procedure

Indexed keywords

ABSTRACT SYNTAX TREES; ALGEBRA HOMOMORPHISMS; ALGEBRAIC DATA-TYPES; CATAMORPHISM; DECIDABLE THEORY; DECISION PROCEDURE; FREE VARIABLE; FUNCTIONAL DATAS; LAMBDA TERMS; MANY-TO-ONE; MULTI-SETS;

ABSTRACTING; ALGEBRA; COMPUTER SOFTWARE; DATA STRUCTURES; LINGUISTICS; RECURSIVE FUNCTIONS;

TREES (MATHEMATICS);

EID: 77950869820     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706325     Document Type: Conference Paper

References (70)

1. F. Baader and S. Ghilardi. Connecting many-sorted theories. In CADE, pages 278-294, 2005.
2. F. Baader and W. Snyder. Unification theory. In Handbook of Automated Reasoning. Elsevier, 2001.
3. M. Barnett, K. R. M. Leino, andW. 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. Barrett, S. Ranise, A. Stump, and C. Tinelli. The Satisfiability Modulo Theories Library (SMT-LIB). http://www.SMT-LIB.org, 2009.
5. C. Barrett, I. Shikanian, and C. Tinelli. An abstract decision procedure for satisfiability in the theory of recursive data types. Electronic Notes in Theoretical Computer Science, 174(8):23-37, 2007.
6. C. Barrett and C. Tinelli. CVC3. In CAV, 2007.
7. B. Beckert, R. Hähnle, and P. H. Schmitt, editors. Verification of Object-Oriented Software: The KeY Approach. LNCS 4334. Springer, 2007.
8. N. Bjørner, N. Tillmann, and A. Voronkov. Path feasibility analysis for string-manipulating programs. In TACAS, pages 307-321, 2009.
9. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1997.
10. C. Boyapati, S. Khurshid, and D. Marinov. Korat: Automated testing based on Java predicates. In ISSTA, 2002.
11. A. R. Bradley and Z. Manna. The Calculus of Computation. Springer, 2007.
12. R. Cartwright and M. Fagan. Soft typing. In PLDI, 1991.
13. K. Claessen and J. Hughes. Quickcheck: a lightweight tool for random testing of haskell programs. In ICFP, pages 268-279, 2000.
14. E. Cohen, M. Dahlweid, M. Hillebrand, D. Leinenbach, M. Moskal, T. Santen, W. Schulte, and S. Tobies. VCC: A practical system for verifying concurrent c. In TPHOLs, 2009.
15. H. Comon and C. Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167-216, 1994.
16. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS, pages 337-340, 2008.
17. L. de Moura and N. Bjørner. Generalized, efficient array decision procedures. In FMCAD, 2009.
18. J. Dunfield. A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, 2007. CMU-CS-07-129.
19. J. Dunfield and F. Pfenning. Tridirectional typechecking. In POPL, pages 281-292, 2004.
20. P. Fontaine. Combinations of theories and the Bernays-Schönfinkel- Ramsey class. In VERIFY, 2007.
21. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV, 2004.
22. S. Ghilardi. Model theoretic methods in combined constraint satisfiability. J. Automated Reasoning, 33(3-4):221-249, 2005.
23. M. Gligoric, T. Gvero, V. Jagannath, S. Khurshid, V. Kuncak, and D. Marinov. On test generation through programming in UDITA. Technical Report LARA-REPORT-2009-5, EPFL, Sep. 2009.
24. C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 1(4):271-281, 1971.
25. W. Hodges. Model Theory, volume 42 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993.
26. P. F. Hoogendijk and R. C. Backhouse. Relational programming laws in the tree, list, bag, set hierarchy. Sci. Comput. Program., 22(1-2), 1994.
27. C. Ihlemann, S. Jacobs, and V. Sofronie-Stokkermans. On local reasoning in verification. In TACAS, pages 265-281, 2008.
28. J. Jaffar. Minimal and complete word unification. Journal of the ACM, 37(1):47-85, 1990.
29. M. Kawaguchi, P. M. Rondon, and R. Jhala. Type-based data structure verification. In PLDI, pages 304-315, 2009.
30. S. Krstić, A. Goel, J. Grundy, and C. Tinelli. Combined satisfiability modulo parametric theories. In TACAS, 2007.
31. V. Kuncak. Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology, February 2007.
32. 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.
33. V. Kuncak, H. H. Nguyen, and M. Rinard. Deciding boolean algebra with presburger arithmetic. J. Automated Reasoning, 2006.
34. V. Kuncak and M. Rinard. Structural subtyping of non-recursive types is decidable. In LICS, 2003.
35. V. Kuncak and M. Rinard. Decision procedures for set-valued fields. In International Workshop on Abstract Interpretation of Object- Oriented Languages, 2005.
36. V. Kuncak and M. Rinard. Towards efficient satisfiability checking for Boolean Algebra with Presburger Arithmetic. In CADE, 2007.
37. S. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using SMT solvers. In POPL, 2008.
38. S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In POPL, 2006.
39. P. Lam, V. Kuncak, and M. Rinard. Generalized typestate checking for data structure consistency. In VMCAI, 2005.
40. P. Maier. Deciding extensions of the theories of vectors and bags. In VMCAI, 2009.
41. G. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, pages 129-198, 1977. (In AMS, (1979)).
42. A. I. Mal'cev. Chapter 23: Axiomatizable classes of locally free algebras of various types. In The Metamathematics of Algebraic Systems, volume 66. North Holland, 1971.
43. Z. Manna, H. B. Sipma, and T. Zhang. Verifying balanced trees. In LFCS, pages 363-378, 2007.
44. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part 1. Comm. A.C.M., 3:184-195, 1960.
45. S. McPeak and G. C. Necula. Data structure specifications via local equality axioms. In CAV, pages 476-490, 2005.
46. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA, volume 523 of LNCS, 1991.
47. A. Møller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In Proc. PLDI, 2001.
48. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. TOPLAS, 1(2):245-257, 1979.
49. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356-364, 1980.
50. 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.
51. M. Odersky, L. Spoon, and B. Venners. Programming in Scala: a comprehensive step-by-step guide. Artima Press, 2008.
52. C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
53. D. C. Oppen. Reasoning about recursively defined data structures. In POPL, pages 151-157, 1978.
54. C. H. Papadimitriou. On the complexity of integer programming. Journal of the ACM, 28(4):765-768, 1981.
55. R. Piskac and V. Kuncak. Decision procedures for multisets with cardinality constraints. In VMCAI, number 4905 in LNCS, 2008.
56. R. Piskac and V. Kuncak. Linear arithmetic with stars. In CAV, 2008.
57. W. Plandowski. Satisfiability of word equations with constants is in PSPACE. Journal of the ACM, 51(3), 2004.
58. J. A. Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12(1), 1965.
59. P. M. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In PLDI, pages 159-169, 2008.
60. T. Rybina and A. Voronkov. A decision procedure for term algebras with queues. ACM Transactions on Computational Logic (TOCL), 2(2):155-181, 2001.
61. V. Sofronie-Stokkermans. Locality results for certain extensions of theories with bridging functions. In CADE, 2009.
62. C. Tinelli and C. Zarba. Combining nonstably infinite theories. Journal of Automated Reasoning, 34(3), 2005.
63. D. Walker and G. Morrisett. Alias types for recursive data structures. In Workshop on Types in Compilation, 2000.
64. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field constraint analysis. In VMCAI, 2006.
65. T. Wies, R. Piskac, and V. Kuncak. Combining theories with shared set operations. In FroCoS: Frontiers in Combining Systems, 2009.
66. H. Xi. Dependently typed pattern matching. Journal of Universal Computer Science, 9(8):851-872, 2003.
67. K. Zee, V. Kuncak, and M. Rinard. Full functional verification of linked data structures. In PLDI, 2008.
68. T. Zhang, H. B. Sipma, and Z. Manna. The decidability of the first-order theory of Knuth-Bendix order. In CADE, 2005.
69. T. Zhang, H. B. Sipma, and Z. Manna. Decision procedures for term algebras with integer constraints. Inf. Comput., 204(10):1526-1574, 2006.
70. D. Zhu and H. Xi. Safe programming with pointers through stateful views. In PADL, 2005.