A framework for counterexample generation and exploration

Authors:
Marsha Chechik;Arie Gurfinkel
Affiliations:
Department of Computer Science, University of Toronto, Toronto, ON, Canada;Department of Computer Science, University of Toronto, Toronto, ON, Canada
Venue:
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Year:
2005

Citing 12
Cited 6

Efficient generation of counterexamples and witnesses in symbolic model checking

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Patterns in property specifications for finite-state verification

Proceedings of the 21st international conference on Software engineering
Model checking

Model checking
Tree-Like Counterexamples in Model Checking

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Efficient Debugging in a Formal Verification Environment

CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
From Falsification to Verification

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
An Algorithmic Approach to Design Exploration

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Certifying Model Checkers

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Evidence-Based Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
chi-Chek: A Multi-valued Model-Checker

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Proof-like counter-examples

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
What went wrong: explaining counterexamples

SPIN'03 Proceedings of the 10th international conference on Model checking software

Let's agree to disagree

Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Explaining Counterexamples Using Causality

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
YASM: a software model-checker for verification and refutation

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Explaining counterexamples using causality

Formal Methods in System Design
Automated support for building behavioral models of event-driven systems

FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Action-based discovery of satisfying subsets: A distributed method for model correction

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model-checking is becoming an accepted technique for debugging hardware and software systems. Debugging is based on the “Check / Analyze / Fix” loop: check the system against a desired property, producing a counterexample when the property fails to hold; analyze the generated counterexample to locate the source of the error; fix the flawed artifact – the property or the model. The success of model-checking non-trivial systems critically depends on making this Check / Analyze / Fix loop as tight as possible. In this paper, we concentrate on the Analyze part of the debugging loop. To this end, we present a framework for generating, structuring and exploring counterexamples either interactively or with the help of user-specified strategies.