Formal Methods in System Design - Special issue on symmetry in automatic verification
Combinatorial algorithms: generation, enumeration, and search
ACM SIGACT News
Model checking
Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
In Code
Automated Boundary Testing from Z and B
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Exploiting Symmetry In Temporal Logic Model Checking
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Better Verification Through Symmetry
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
Symmetry and reduced symmetry in model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Symmetry Breaking for Boolean Satisfiability
IEEE Transactions on Computers
Automatic refinement checking for b
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Employing symmetry reductions in model checking
Computer Languages, Systems and Structures
The High Road to Formal Validation
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Automated Property Verification for Large Scale B Models
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Guiding the correction of parameterized specifications
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Validating Z specifications using the PROB animator and model checker
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Efficient approximate verification of B and Z models via symmetry markers
Annals of Mathematics and Artificial Intelligence
On symmetries and spotlights: verifying parameterised systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A refinement-based correctness proof of symmetry reduced model checking
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Validation of formal models by refinement animation
Science of Computer Programming
| Hi-index | 0.00 |
Symmetry reduction is an established method for limiting the amount of states that have to be checked during exhaustive model checking. The idea is to only verify a single representative of every class of symmetric states. However, computing this representative can be non-trivial, especially for a language such as B with its involved data structures and operations. In this paper, we propose an alternate approach, called permutation flooding. It works by computing permutations of newly encountered states, and adding them to the state space. This turns out to be relatively unproblematic for B's data structures and we have implemented the algorithm inside the ProB model checker. Empirical results confirm that this approach is effective in practice; speedups exceed an order of magnitude in some cases. The paper also contains correctness results of permutation flooding, which should also be applicable for classical symmetry reduction in B.