Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Symbolic Model Checking
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Practical Model-Checking Using Games
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On Automatically Explaining Bisimulation Inequivalence
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Computing Distinguishing Formulas for Branching Bisimulation
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
"On the Fly" Verification of Behavioural Equivalences and Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Error Diagnosis in Finite Communicating Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Efficient Local Correctness Checking
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion
Proceedings of the 7th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Using On-The-Fly Verification Techniques for the Generation of test Suites
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
A Linear Algorithm for Solving Fixed-Point Equations on Transition Systems
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Proof graphs for parameterised boolean equation systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
Boolean Equation Systems (Bess) provide a useful framework for the verification of concurrent finite-state systems. In practice, it is desirable that a Bes resolution also yields diagnosticin formation explaining, preferably in a concise way, the truth value computed for a given variable of the BES. Using a representation of BESs as extended boolean graphs (EBGs), we propose a characterization of full diagnostics (i.e., both examples and counterexamples) as a particular class of subgraphs of the EBG associated to a BES. We provide algorithms that compute examples and counterexamples in linear time and can be straightforwardly used to extend known (global or local) BES resolution algorithms with diagnostic generation facilities.