Abstract
The presented approach aims at identifying false conjectures about free data types. Given a specification and a conjecture, the method performs a search for a model of an according counter specification. The model search is tailor-made for the semantical setting of free data types, where the fixed domain allows to describe models just in terms of interpretations. For sake of interpretation construction, a theory specific calculus is provided. The concrete rules are ‘executed’ by a procedure known as model generation. As most free data types have infinite domains, the ability of automatically solving the non-consequence problem is necessarily limited. That problem is addressed by limiting the instantiation of the axioms. This approximation leads to a restricted notion of model correctness, which is discussed. At the same time, it enables model completeness for free data types, unlike approaches based on limiting the domain size.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
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.
Christian Fermüller and Alexander Leitsch. Hyperresolution and automated model building. Journal of Logic and Computation, 6(2), 1996.
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.
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.
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.
Martin Protzen. Disproving conjectures. In D. Kapur, editor, Proc. 11th CADE, Albany/NY, USA, volume 607 of LNAI, pages 340–354. Springer-Verlag, 1992.
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.
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.
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.
Andreas Thums. Fehlersuche in Formalen Spezifikationen. diploma thesis, Fakultät für Informatik, Universität Ulm, 1998.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahrendt, W. (2002). Deductive Search for Errors in Free Data Type Specifications Using Model Generation. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_18
Download citation
DOI: https://doi.org/10.1007/3-540-45620-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43931-8
Online ISBN: 978-3-540-45620-9
eBook Packages: Springer Book Archive