Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Evolving algebras 1993: Lipari guide
Specification and validation methods
Automating first-order relational logic
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Logic; A Foundation for Computer Science (International Computer Science Series)
Logic; A Foundation for Computer Science (International Computer Science Series)
Formal System Development with KIV
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
The KIV-Approach to Software Verification
KORSO - Methods, Languages, and Tools for the Construction of Correct Software
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Towards Trustworthy Specifications I: Consistency Checks
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
The Importance of Non-theorems and Counterexamples in Program Verification
Verified Software: Theories, Tools, Experiments
Automating Algebraic Specifications of Non-freely Generated Data Types
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Proving programs incorrect using a sequent calculus for Java dynamic logic
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Bounded relational analysis of free data types
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Automated Flaw Detection in Algebraic Specifications
Journal of Automated Reasoning
| Hi-index | 0.00 |
In verification of finite domain models (model checking) counterexamples help the user to identify, why a proof attempt has failed. In this paper we present an approach to construct counterexamples for first-order goals over infinite data types, which are defined by algebraic specifications. The approach avoids the implementation of a new calculus, by integrating counterexample search with the interactive theorem proving strategy. The paper demonstrates, that this integrations requires only a few modifications to the theorem proving strategy.