Relational analysis of algebraic datatypes

ESEC/FSE'05 - Proceedings of the Joint 10th European Software Engineering Conference (ESEC) and 13th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-13)

Volumn , Issue , 2005, Pages 207-216

  Kuncak, Viktor ^a   Jackson, Daniel ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algebraic datatypes; Constraint solving; Model checking; Model finding; Transitive closure logic

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONSTRAINT THEORY; FORMAL LOGIC; SYNTACTICS;

ALGEBRAIC DATATYPES; CONSTRAINT SOLVING; MODEL CHECKING; MODEL FINDING; TRANSITIVE CLOSURE LOGIC;

DATA REDUCTION;

EID: 32344437792     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081706.1081740     Document Type: Conference Paper

References (44)

1. The Alloy project. http://alloy.mit.edu/.
2. E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P. D. Mosses, D. Sannella, and A. Tarlecki. CASL: The Common Algebraic Specification Language. Theoretical Computer Science, 286(2):153-196, 2002.
3. R. Bird, Introduction to Functional Programming using Haskell. Prentice-Hall, Inc., 2nd edition, 1998.
4. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236(1-2):35-132, 2000.
5. C. Boyapati, S. Khurshid, and D. Marinov. Korat: Automated testing based on Java predicates. In Proc. International Symposium on Software Testing ana Analysis, pages 123-133, July 2002.
6. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier, In N. Halbwachs and D. Peled, editors, Proceedings Eleventh Conference on Computer-Aided Verification (CAV'99), number 1633 in LNCS, pages 495-499, Trento, Italy, July 1999, Springer.
7. K. Claessen and N. Sörensson, New techniques that improve MACE-style model finding. In Model Computation, 2003.
8. K. J. Compton and C. W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48(1): 1-79, July 1990.
9. J. Ferrante and C. W. Rackoff. The Computational Complexity of Logical Theories, volume 718 of Lecture Notes in Mathematics, Springer-Verlag, 1979.
10. M. Gogolla, J. Bohling, and M. Richters. Validating UML and OCL models in USE by automatic snapshot generation. Journal on Software and System Modeling, 2005. to appear.
11. J. V. Guttag. Abstract data types, then and now, In Software Pioneers: Contributions to Software Engineering, pages 442-452. Springer, 2002.
12. J. V. Guttag, E. Horowitz, and D. R. Musser, Abstract data types and software validation, Communications of the ACM, 21(12):1048-1064, 1978.
13. V. Haarslev and R. Möller. RACER system description. In International Joint Conference on Automated Reasoning, 2001.
14. W. Hodges. Model Theory, volume 42 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993.
15. I. Horrocks. Using an expressive description logic: FaCT or fiction? In International Conference on Principles of Knowledge Representation and Reasoning, pages 636-647, 1998.
16. 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.
17. D. Jackson. Automating first-order relational logic. In Proc. ACM SIGSOFT Conf., Foundations of Software Engineering, 2000.
18. D. Jackson. Object models as heap invariants. In A. McIver and C. Morgan, editors, Collected Papers of IFIP Working Group 2.3 on Programming Methodology, Springer-Verlag, 2001.
19. D. Jackson, I. Shlyakhter, and M. Sridharan. A micromodularity mechanism. In Proc. ACM SIGSOFT Conf. Foundations of Software Engineering / European Software Engineering Conference (FSE/ESEC '01), 2001.
20. 20 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1-33, Washington, D.C., 1990. IEEE Computer Society Press.
21. N. Klarlund, A. Møller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
22. V. Kuncak and D. Jackson. On relational analysis of algebraic datatypes. Technical Report 985, MIT, April 2005.
23. V. Kuncak and M. Rinard. On the theory of structural subtyping. Technical Report 879, Laboratory for Computer Science, Massachusetts Institute of Technology, 2003.
24. V. Kuncak and M. Rinard. Structural subtyping of non-recursive types is decidable. In Eighteenth Annual IEEE Symposium on Logic in Computer Science, 2003.
25. X. Leroy. The Objective Caml system, release 3.08, July 2004.
26. M. Leuschel and M. J. Butler. ProB: A model checker for B. In Formal Methods Europe, pages 855-874, 2003.
27. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Proc. 7th International Static Analysis Symposium, 2000.
28. M. J. Maher. Complete axiomatizations of the algebras of the finite, rational, and infinite trees. IEEE Symposium on Logic in Computer Science, 1988.
29. A. I. Mal'cev. The Metamathematics of Algebraic Systems, volume 66 of Studies in Logic and The Foundations of Mathematics. North Holland, 1971.
30. D. Marinov. Automatic Testing of Software with Structurally Complex Inputs. PhD thesis, MIT, 2005.
31. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part 1. Comm. A.C.M., 3:184-195, 1960.
32. W. McCune. MACE 2.0 Reference Manual and Guide. ArXvi Computer Science, e-prints, June 2001.
33. E. Mendelson. Introduction to Mathematical Logic. Chapman & Hall, London, 4th edition, 1997.
34. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Mass., 1997.
35. A. Møller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In Programming Language Design and Implementation, 2001.
36. D. C. Oppen. Reasoning about recursively defined data structures. Journal of the ACM, 27(3), 1980.
37. M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1-35, 1969.
38. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modelling Language Reference Manual. Addison-Wesley, Reading, Mass., 1999.
39. J. R. Rumbaugh, M. R. Blaha, W. Lorensen, F. Eddy, and W. Premerlani. Object-Oriented Modeling and Design. Prentice Hall, Englewood Cliffs, New Jersey 07632, USA, 1991.
40. T. Sturm and V. Weispfenning. Quantifier elimination in term algebras: The case of finite languages. In V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, editors, Computer Algebra in Scientific Computing (CASC), TUM Muenchen, 2002.
41. R. Treinen. Feature trees over arbitrary structures. In P. Blackburn and M. de Rijke, editors, Specifying Syntactic Structures, chapter 7, pages 185-211. CSLI Publications and FoLLI, 1997.
42. K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebras. Journal of the ACM (JACM), 34(2):492-510, 1987.
43. T. Zhang, H. B. Sipma, and Z. Manna. Decision procedures for recursive data structures with integer constraints. In International Joint Conference on Automated Reasoning, volume 3097 of LNCS, pages 157-167, 2004.
44. T. Zhang, H. B. Sipma, and Z. Manna. Term algebras with length function and bounded quantifier alternation. In Theorem Proving in Higher-Order Logics, volume 3223 of LNCS, pages 321-336, 2004.