Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Fairness
Design and validation of computer protocols
Design and validation of computer protocols
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Combining Partial Order and Symmetry Reductions
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
Proceedings of the 7th International Conference on Computer Aided Verification
On-the-Fly Model Checking Under Fairness That Exploits Symmetry
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Nested emptiness search for generalized Büchi automata
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
Exact and approximate strategies for symmetry reduction in model checking
FM'06 Proceedings of the 14th international conference on Formal Methods
A computational group theoretic symmetry reduction package for the SPIN model checker
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Efficient symmetry reduction for an actor-based model
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Nested Emptiness Search for Generalized Büchi Automata
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
| Hi-index | 0.00 |
We present an algorithm for (explicit state) model checking under weak fairness that exploits symmetry for state space reduction. It is assumed that the checked properties are given as Büchi automata. The algorithm is based on the Nested Depth First Search (NDFS) algorithm by Courcoubetis, Vardi, Wolper and Yannakakis. The weak fairness aspect is captured by a version of the Choueka flag algorithm. As the presented algorithm allows false positives, it is mainly intended for efficient systematic debugging. However, we show that for this more modest goal our algorithm has significant advantages over the existing full-fledged model checking algorithms that exploit symmetry under weak fairness. The prototype implementation on top of Spin showed encouraging results.