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
Improved reachability analysis of large finite state machines
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Reachability analysis using partitioned-ROBDDs
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Parallel Model Checking for the Alternation Free µ-Calculus
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Distributed LTL Model Checking Based on Negative Cycle Detection
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Distributed Symbolic Model Checking for µ-Calculus
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Truth/SLC - A Parallel Verification Platform for Concurrent Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CTL* model checking on a shared-memory architecture
Formal Methods in System Design
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
Measuring and Evaluating Parallel State-Space Exploration Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed model-checking and counterexample search for CTL logic
International Journal of Critical Computer-Based Systems
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Distributed CTL model-checking and counterexample search
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
On parallel software verification using boolean equation systems
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Action-based discovery of satisfying subsets: A distributed method for model correction
Information and Software Technology
| Hi-index | 0.00 |
We describe the design of (several variants of) a local parallel model-checking algorithm for the alternation-free fragment of the 碌-calculus. It exploits a characterisation of the problem for this fragment in terms of two-player games. For the corresponding winner, our algorithm determines in parallel a winning strategy, which may be employed for debugging the underlying system interactively, and is designed to run on a network of workstations. Depending on the variant, its complexity is linear or quadratic. A prototype implementation within the verification tool Truth shows promising results in practice.