Symmetry reduction for B by permutation flooding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4355 LNCS, Issue , 2006, Pages 79-93

  Leuschel, Michael ^a   Butler, Michael ^b   Spermann, Corinna ^a   Turner, Edd ^b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

B method; Model checking; Symmetry reduction; Tool support

Indexed keywords

DATA STRUCTURES; FLOODS;

ALTERNATE APPROACHES; B METHOD; MODEL CHECKER; SYMMETRIC STATE; SYMMETRY REDUCTION; TOOL SUPPORT;

MODEL CHECKING;

EID: 84992005103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11955757_9     Document Type: Conference Paper

References (18)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah. Solving difficult SAT instances in the presence of symmetry. In DAC, pages 731–736. ACM, 2002.
3. F. A. Aloul, K. A. Sakallah, and I. L. Markov. Efficient symmetry breaking for boolean satisfiability. IEEE Trans. Computers, 55(5):549–558, 2006.
4. M. Butler and M. Leuschel. Combining CSP and B for specification and property verification. In Proceedings of Formal Methods 2005, LNCS 3582, pages 221–236, Newcastle upon Tyne, 2005. Springer-Verlag.
5. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In C. Courcoubetis, editor, CAV’93, LNCS 697, pages 450–462. Springer-Verlag, 1993.
6. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
7. J. M. Crawford, M. L. Ginsberg, E. M. Luks, and A. Roy. Symmetry-breaking predicates for search problems. In KR 1996, pages 148–159, 1996.
8. P. T. Darga, M. H. Liffiton, K. A. Sakallah, and I. L. Markov. Exploiting structure in symmetry detection for CNF. In S. Malik, L. Fix, and A. B. Kahng, editors, DAC, pages 530–534. ACM, 2004.
9. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9(1/2):105–131, 1996.
10. S. Flannery. In Code: A Mathematical Adventure. Profile Books Ltd, 2001.
11. C. N. Ip and D. L. Dill. Better verification through symmetry. In Computer Hardware Description Languages and their Applications, pages 97–111, 1993.
12. D. L. Kreher and D. R. Stinson. Combinatorial Algorithms: Generation, Enumeration, Search. CRC Press, 1999.
13. B. Legeard, F. Peureux, and M. Utting. Automated boundary testing from Z and B. In Proceedings FME’02, LNCS 2391, pages 21–40. Springer-Verlag, 2002.
14. M. Leuschel and M. Butler. ProB: A model checker for B. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME 2003: Formal Methods, LNCS 2805, pages 855–874. Springer-Verlag, 2003.
15. M. Leuschel and M. Butler. Automatic refinement checking for B. In K.-K. Lau and R. Banach, editors, Proceedings ICFEM’05, LNCS 3785, pages 345–359. Springer-Verlag, 2005.
16. B. McKay. Nauty users guide. Available at http://cs.anu.edu.au/people/bdm/nauty/.
17. A. P. Sistla. Employing symmetry reductions in model checking. Computer Languages, Systems & Structures, 30(3-4):99–137, 2004.
18. A. P. Sistla and P. Godefroid. Symmetry and reduced symmetry in model checking. ACM Trans. Program. Lang. Syst., 26(4):702–734, 2004.