Deductive search for errors in free data type specifications using model generation

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

Volumn 2392, Issue , 2002, Pages 211-225

  Ahrendt, Wolfgang ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CALCULATIONS; THEOREM PROVING;

DATA TYPE; DOMAIN SIZE; INFINITE DOMAINS; MODEL GENERATION; MODEL SEARCH;

SPECIFICATIONS;

EID: 84948977258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_18     Document Type: Conference Paper

References (15)

1. Wolfgang Ahrendt. Deduktive Fehlersuche in Abstrakten Datentypen. 2001. Dissertation (preversion, in German), University of Karlsruhe, available under http://www.cs.chalmers.se/˜ahrendt/cade02/diss.ps.gz.
2. Leo Bachmair. Proof by consistency in equational theories. In Proc. Third Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, pages 228–233. IEEE Press, 1988.
3. François Bry and Sunna Torge. A deduction method complete for refutation and finite satisfiability. In Proc. 6th European Workshop on Logics in AI (JELIA), volume 1489 of LNAI, pages 122–136. Springer-Verlag, 1998.
4. Ricardo Caferra and Nicolas Peltier. Combining enumeration and deductive techniques in order to increase the class of constructible infinite models. Journal of Symbolic Computation, 29:177–211, 2000.
5. Hiroshi Fujita and Ryuzo Hasegawa. A model generation theorem prover in KL1 using a ramified-stack algorithm. In Koichi Furukawa, editor, Proceedings 8th International Conference on Logic Programming, Paris/France, pages 535–548. MIT Press, 1991.
6. Christian Fermüller and Alexander Leitsch. Hyperresolution and automated model building. Journal of Logic and Computation, 6(2), 1996.
7. Martin Giese and Wolfgang Ahrendt. Hilbert’s ε-terms in Automated Theorem Proving. In Neil V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, Saratoga Springs, USA, volume 1617 of LNAI, pages 171–185. Springer-Verlag, 1999.
8. Rainer Manthey and François Bry. SATCHMO: A theorem prover implemented in Prolog. In Proceedings 9th Conference on Automated Deduction, volume 310 of LNCS, pages 415–434. Springer-Verlag, 1988.
9. Raul Monroy, Alan Bundy, and Andrew Ireland. Proof plans for the correction of false conjectures. In Frank Pfenning, editor, Proc. 5th International Conference on Logic Programming and Automated Reasoning, Kiev, Ukraine, volume 822 of LNAI, pages 54–68. Springer-Verlag, 1994.
10. Martin Protzen. Disproving conjectures. In D. Kapur, editor, Proc. 11th CADE, A lbany/NY,USA, volume 607 of LNAI, pages 340–354. Springer-Verlag, 1992.
11. Martin Protzen. Patching faulty conjectures. In Michael McRobbie and John Slaney, editors, Proc. 13th CADE, New Brunswick/NJ,USA, volume 1104 of LNCS, pages 77– 91. Springer-Verlag, 1996.
12. Wolfgang Reif, Gerhard Schellhorn, and Andreas Thums. Flaw detection in formal specifications. In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors, Automated Reasoning, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings, volume 2083 of LNAI. Springer-Verlag, 2001.
13. John Slaney. FINDER: finite domain enumerator. In Alan Bundy, editor, Proc. 12th CADE, Nancy/France, volume 814 of LNCS, pages 798–801. Springer-Verlag, 1994.
14. Andreas Thums. Fehlersuche in Formalen Spezifikationen. diploma thesis, Fakultät für Informatik, Universität Ulm, 1998.
15. Jian Zhang and Hantao Zhang. Generating models by SEM. In Michael McRobbie and John Slaney, editors, Proc. 13th CADE, New Brunswick/NJ, USA, volume 1104 of LNCS, pages 309–327. Springer-Verlag, 1996.