Integrating model checking and theorem proving for relational reasoning

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

Volumn 3051, Issue , 2004, Pages 21-33

  Arkoudas, Konstantine ^a   Khurshid, Sarfraz ^a   Marinov, Darko ^a   Rinard, Martin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; THEOREM PROVING;

ALLOY ANALYZERS; DECLARATIVE LANGUAGES; INTEGRATING MODEL; PROOF OBLIGATIONS; RELATIONAL REASONING; UNIVERSE OF DISCOURSE;

MODEL CHECKING;

EID: 35048836124     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24771-5_3     Document Type: Article

References (21)

1. TPTP problem library for automated theorem proving. www.cs.miami.edu/ ~tptp.
2. K. Arkoudas. Type-ω DPLs. MIT AI Memo 2001-27, 2001.
3. M. F. Frias. Fork Algebras in Algebra, Logic and Computer Science. World Scientific Publishing Co., 2002.
4. M. F. Frias, C. G. L. Pombo, G. A. Baum, N. M. Aguirre, and T. Maibaum. Taking alloy to the movies. In Proc. Formal Methods Europe (FME), Sept. 2003.
5. 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.
6. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. The MIT Press, Cambridge, MA, 2000.
7. D. Jackson. Micromodels of software: Modelling and analysis with Alloy, 2001. http://sdg.lcs.mit.edu/alloy/book.pdf.
8. D. Jackson, I. Schechter, and I. Shlyakhter. ALCOA: The Alloy constraint analyzer. In Proc. 22nd International Conference on Software Engineering (ICSE), Limerick, Ireland, June 2000.
9. D. Jackson and K. Sullivan. COM revisited: Tool-assisted modeling of an architectural framework. In Proc. 8th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), San Diego, CA, 2000.
10. S. Khurshid and D. Jackson. Exploring the design of an intentional naming scheme with an automatic constraint analyzer. In Proc. 15th IEEE International Conference on Automated Software Engineering (ASE), Grenoble, France, Sep 2000.
11. S. Khurshid, D. Marinov, and D. Jackson. An analyzable annotation language. In Proc. ACM SIGPLAN 2002 Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Seattle, WA, Nov 2002.
12. D. Marinov and S. Khurshid. TestEra: A novel framework for automated testing of Java programs. In Proc. 16th IEEE International Conference on Automated Software Engineering (ASE), San Diego, CA, Nov. 2001.
13. W. McCune. Mace: Models and counter-examples. http://www-unix.mcs.anl. gov/AR/mace/, 2001.
14. S. Owre, J. Rushby, and N. Shankar. PVS: A prototype verification system. In Proc. 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752, Saratoga, NY, June 1992.
15. L. Paulson. Isabelle, A Generic Theorem Prover. Lecture Notes in Computer Science. Springer-Verlag, 1994.
16. g dynamic logic in PVS. Technical Report SRI-CSL-02-04, SRI International, Menlo Park, CA, May 2003.
17. A. Riazanov and A. Voronkov. The design and implementation of VAMPIRE. AI Communications, 15(2-3), 2002.
18. S. Rajan, N. Shankar, and M. K. Srivas. An integration of model checking with automated proof checking. In Proceedings of the 7th International Conference On Computer Aided Verification, volume 939, Liege, Belgium, 1995. Springer Verlag.
19. N. Shankar. Combining theorem proving and model checking through symbolic analysis. Lecture Notes in Computer Science, 1877, 2000.
20. M. Vaziri and D. Jackson. Checking properties of heap-manipulating procedures with a constraint solver. In Proc. 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), Warsaw, Poland, April 2003.
21. L. Wos, R. Overbeek, E. Lusk, and J. Boyle. Automated Reasoning, Introduction and Applications. McGraw-Hill, Inc., 1992.