Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Model checking
Model checking systems of replicated processes with spin
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Finding the smallest image of a set
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Exact and approximate strategies for symmetry reduction in model checking
FM'06 Proceedings of the 14th international conference on Formal Methods
Automatic Symmetry Detection for Promela
Journal of Automated Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient approximate verification of Promela models via symmetry markers
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On the constructive orbit problem
Annals of Mathematics and Artificial Intelligence
Ten years of analyzing actors: Rebeca experience
Formal modeling
Hi-index | 0.00 |
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be represented by an integer, and where components do not hold references to one another. Symmetry reduction techniques for model checking usually require a solution to the NP-hard Constructive Orbit Problem (COP)-computing the minimum element in the equivalence class of a given state under a symmetry group. Polynomial time strategies to solve instances of the COP under the simple model of computation are known for a large class of symmetry groups. We show that these strategies are not directly applicable when the model of computation is extended to allow components to hold references to one another, and present an approach to their extension, resulting in tractable, memory optimal symmetry reduction techniques for a realistic model of computation. Experimental results using the TopSpin symmetry reduction package for the Spin model checker illustrate the effectiveness of our techniques.