Declarative programming for verification: lessons and outlook
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
The High Road to Formal Validation
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Automated Property Verification for Large Scale B Models
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Efficient approximate verification of B and Z models via symmetry markers
Annals of Mathematics and Artificial Intelligence
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
| Hi-index | 0.00 |
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (orbit) of symmetric states. This paper presents a framework for symmetry reduced model checking of B machines, which verifies a unique representative from each orbit. Symmetries are induced by the deferred set; a key component of the B language. This contrasts with strategies that require the introduction of a special data type into a language, to indicate symmetry. An extended version of the graph isomorphism program, nauty, is used to detect symmetries, and the symmetry reduction package has been integrated into the PROB model checker. Relevant algorithms are presented, and experimental results illustrate the effectiveness of the method, where exponential speedups are sometimes possible.