Symmetry reduced model checking for B

First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, TASE '07

Volumn , Issue , 2007, Pages 25-34

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

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; SOFTWARE PACKAGES;

DATA TYPE; GRAPH ISOMORPHISM PROGRAM; PROB MODEL CHECKER; STATE SPACE EXPLOSION;

BUSINESS MACHINES;

EID: 34548834970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TASE.2007.50     Document Type: Conference Paper

References (25)

1. J. R. Abrial. The B Book: Assigning programs to meanings. Cambridge University Press, New York, NY, USA, 1996.
2. B-Core (UK) Limited, Oxon, UK. B-Toolkit, On-line manual, 1999.
3. D. Bosnacki, D. Dams, and L. Holenderski. Symmetric SPIN. STTT International Journal on Software Tools for Technology Transfer, 4(1):92-106, 2002.
4. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In C. Courcoubetis, editor, CAV, volume 697 of Lecture Notes in Computer Science, pages 450-462, London, UK, 1993. Springer-Verlag.
5. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Trans. Program. Lang. Syst., 16(5):1512-1542, 1994.
6. E. M. Clarke, O. Grumberg, and D. Peled. Model checking. The MIT Press, 1999.
7. J. M. Crawford, M. L. Ginsberg, E. M. Luks, and A. Roy. Symmetry-breaking predicates for search problems. In KR, 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. A. F. Donaldson and A. Miller. Exact and approximate strategies for symmetry reduction in model checking. In J. Misra, T. Nipkow, and E. Sekerinski, editors, FM, volume 4085 of Lecture Notes in Computer Science, pages 541-556. Springer, 2006.
10. S. Flannery and D. Flannery. In Code: A Mathematical Journey. Algonquin Books of Chapel Hill, Chapel Hill, NC, USA, 2001.
11. P. Foggia, C. Sansone, and M. Vento. A performance comparison of five algorithms for graph isomorphism. In 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
12. G. J. Holzmann and D. Peled. An improvement in formal verification. In D. Hogrefe and S. Leue, editors, FORTE, volume 6 of IFIP Conference Proceedings, pages 197-211. Chapman & Hall, 1994.
13. C.-W. N. Ip and D. L. Dill. Better verification through symmetry. In D. Agnew, L. J. M. Claesen, and R. Camposano, editors, CHDL, volume A-32 of IFIP Transactions, pages 97-111. North-Holland, 1993.
14. D. Jackson. Software Abstractions: Logic, Language, and Analysis. MIT Press, 2006.
15. W. Kocay. On Writing Isomorphism Programs, chapter Chapter 6, pages 135-175. Computational and Constructive Design Theory. Kluwer, 1996.
16. D. L. Kreher. Combinatorial Algorithms: Generation, Enumeration and Search. Discrete Mathematics and its Applications. CRC Press, 1998.
17. B. Legeard, F. Peureux, and M. Utting. Automated boundary testing from Z and B. In L.-H. Eriksson and P. A. Lindsay, editors, FME, volume 2391 of Lecture Notes in Computer Science, pages 21-40. Springer, 2002.
18. M. Leuschel, M. Butler, C. Spermann, and E. Turner. Symmetry reduction for B by permutation flooding. In J. Julliand and O. Kouchnarenko, editors, B, volume 4355 of Lecture Notes in Computer Science, pages 79-93. Springer-Verlag, 2007.
19. M. Leuschel and M. J. Butler. ProB: A model checker for B. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME, volume 2805 of Lecture Notes in Computer Science, pages 855-874. Springer, 2003.
20. M. Leuschel and M. J. Butler. Automatic refinement checking for B. In K.-K. Lau and R. Banach, editors, ICFEM, volume 3785 of Lecture Notes in Computer Science, pages 345-359. Springer, 2005.
21. B. D. McKay. Practical graph isomorphism. In Numerical mathematics and computing, Proc. 10th Manitoba Conf., Congr. Numerantium 30, pages 45-87, 1981.
22. B. D. McKay. NAUTY user's guide (version 1.5), Technical report TR-CS-90-02. Australian National University, Computer Science Department, ANU, 1990.
23. T. Miyazaki. The complexity of Mckay's canonical labeling algorithm. In L. Finkelstein and W. M. Kantor, editors, Groups and Computation II, volume 28 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 239-256. American Mathematical Society, Providence, Rhode Island 02940, USA, 1997.
24. Robby, M. B. Dwyer, J. Hatcliff, and R. Iosif. Space-reduction strategies for model checking dynamic software. Electr. Notes Theor. Comput. Sci., 89(3), 2003.
25. Steria, Aix-en-Provence, France. Atelier B, User and Reference Manuals, 1996.