The art of parallel programming
The art of parallel programming
New techniques for efficient verification with implicitly conjoined BDDs
DAC '94 Proceedings of the 31st annual Design Automation Conference
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
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
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Parallel Processing and Parallel Algorithms: Theory and Computation
Parallel Processing and Parallel Algorithms: Theory and Computation
Symbolic Model Checking
Communication and Concurrency
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
A Formal Specification and Validation of a Critical System in Presence of Byzantine Errors
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
CAV '00 Proceedings of the 12th 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
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
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Local Parallel Model Checking for the Alternation-Free µ-Calculus
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
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
CTL* model checking on a shared-memory architecture
Formal Methods in System Design
Dealing with practical limitations of distributed timed model checking for timed automata
Formal Methods in System Design
Distributed Verification of Multi-threaded C++ Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
From Distributed Memory Cycle Detection to Parallel LTL Model Checking
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 verification: exploring the power of raw computing power
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Distributed explicit fair cycle detection: set based approach
SPIN'03 Proceedings of the 10th international conference on Model checking software
Tutorial: parallel model checking
Proceedings of the 14th international SPIN conference on Model checking software
Cluster-Based LTL model checking of large systems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
DiVinE: a tool for distributed verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Editorial: Recent developments in high performance computing and security: An editorial
Future Generation Computer Systems
| Hi-index | 0.00 |
In this paper, we describe the design and implementation of a parallel model checking algorithm for the alternation free fragment of the 碌-calculus. It exploits a characterisation of the model checking problem for this fragment in terms of two-person games. Our algorithm determines the corresponding winner in parallel. It is designed to run on a network of workstations. An implementation within the verification tool TRUTH shows promising results.