Symmetry reduction for B by permutation flooding
Symmetry reduction for B by permutation flooding
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.
978-3-540-68760-3
79-93
Springer Berlin, Heidelberg
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Spermann, Corinna
61aadec0-008a-4ead-8cee-b17ffb53d8e6
Turner, Edd
596dae00-b3c7-4ce6-9899-c37bf2d3a0ce
14 December 2006
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Spermann, Corinna
61aadec0-008a-4ead-8cee-b17ffb53d8e6
Turner, Edd
596dae00-b3c7-4ce6-9899-c37bf2d3a0ce
Leuschel, Michael, Butler, Michael, Spermann, Corinna and Turner, Edd
(2006)
Symmetry reduction for B by permutation flooding.
Julliand, Jacques and Kouchnarenko, Olga
(eds.)
In B 2007: Formal Specification and Development in B.
Springer Berlin, Heidelberg.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
Text
poor_mansym_B2007_final.pdf
- Accepted Manuscript
Restricted to Repository staff only
Request a copy
More information
e-pub ahead of print date: 12 December 2006
Published date: 14 December 2006
Venue - Dates:
7th International Conference of B Users, , Besancon, France, 2007-01-07 - 2007-01-19
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 264454
URI: http://eprints.soton.ac.uk/id/eprint/264454
ISBN: 978-3-540-68760-3
ISSN: 0302-9743
PURE UUID: e2aeb661-b928-4fce-99d6-86b25e345df9
Catalogue record
Date deposited: 05 Sep 2007
Last modified: 18 Mar 2024 02:41
Export record
Contributors
Author:
Michael Leuschel
Author:
Michael Butler
Author:
Corinna Spermann
Author:
Edd Turner
Editor:
Jacques Julliand
Editor:
Olga Kouchnarenko
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics