FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Data flow testing as model checking
Proceedings of the 25th International Conference on Software Engineering
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
Relating counterexamples to test cases in CTL model checking specifications
Proceedings of the 3rd international workshop on Advances in model-based testing
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
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
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Issues in using model checkers for test case generation
Journal of Systems and Software
CTL model update for system modifications
Journal of Artificial Intelligence Research
Enhancing Test Coverage by Back-tracing Model-checker Counterexamples
Electronic Notes in Theoretical Computer Science (ENTCS)
Incompleteness of states w.r.t. traces in model checking
Information and Computation
Action Language verifier: an infinite-state model checker for reactive software specifications
Formal Methods in System Design
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Model checking with SAT-based characterization of ACTL formulas
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
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
On the notion of vacuous truth
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Distributed BDD-based BMC for the verification of multi-agent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Foundations of Tree-like Local Model Updates
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The localization reduction and counterexample-guided abstraction refinement
Time for verification
A state/event-based model-checking approach for the analysis of abstract system properties
Science of Computer Programming
Local model update with an application to sliding window protocol
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part IV
ACTL local model update with constraints
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part IV
Making prophecies with decision predicates
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Exploring inconsistencies between modal transition systems
Software and Systems Modeling (SoSyM)
Abstraction for model checking multi-agent systems
Frontiers of Computer Science in China
Temporal property verification as a program analysis task
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Abstraction and refinement in model checking
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Distributed model-checking and counterexample search for CTL logic
International Journal of Critical Computer-Based Systems
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
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Distributed CTL model-checking and counterexample search
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
Temporal property verification as a program analysis task
Formal Methods in System Design
Efficient Algorithms for Games Played on Trees with Back-edges
Fundamenta Informaticae
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Action-based discovery of satisfying subsets: A distributed method for model correction
Information and Software Technology
Minimal proof search for modal logic k model checking
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Model checking agent knowledge in dynamic access control policies
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Solving infinite games on trees with back-edges
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Proof graphs for parameterised boolean equation systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
Counterexamples for specification violations provide engineers with important debugging information. Although counterexamples are considered one of the main advantages of model checking, state-of the art model checkers are restricted to relatively simple counterexamples, and surprisingly little research effort has been put into counterexamples. In this paper, we introduce a new general framework for counterexamples. The paper has three main contributions: (i) We determine the general form of ACTL counterexamples. To this end, we investigate the notion of counterexample and show that a large class of temporal logics beyond ACTL admits counterexamples with a simple tree-like transition relation. We show that the existence of tree-like counterexamples is related to a universal fragment of extendedbranching time logic based on !