Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
About the expressive power of CTL combinators
Information Processing Letters
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Model checking
From model checking to a temporal proof
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symbolic Model Checking
Model exploration with temporal logic query checking
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
Model-Checking Software Using Precise Abstractions
Verified Software: Theories, Tools, Experiments
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Making the Most of BMC Counterexamples
Electronic Notes in Theoretical Computer Science (ENTCS)
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Providing evidence of likely being on time: counterexample generation for CTMC model checking
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
A state/event-based model-checking approach for the analysis of abstract system properties
Science of Computer Programming
YASM: a software model-checker for verification and refutation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A framework for counterexample generation and exploration
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
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
| Hi-index | 0.00 |
Counter-examples explain why a desired temporal logic property fails to hold, and as such considered to be the most useful form of output from model-checkers. Reported explanations are typically short and described in terms of states and transitions of the model; as a result, they can be effectively used for debugging. However, counter-examples are not available for every CTL property and are often inadequate for explaining exactly what the answer means [CLJV02]. In this paper, we present the approach of annotating counter-examples with additional proof steps. This approach does not sacrifice any of the advantages of traditional counter-examples, yet allows the user to understand and navigate through the counter-example better.We describe our proof system, discuss how to connect it with counter-example generators, and present KEGVis - a tool for visualizing and browsing the annotated counter-examples.