Visualising larger state spaces in PROB

Lecture Notes in Computer Science

Volumn 3455, Issue , 2005, Pages 6-23

  Leuschel, Michael ^a,b   Turner, Edd ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Animation; B Method; Formal Methods; Logic Programming; Model Checking; Tool Support; Visualisation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; INFORMATION ANALYSIS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; STATE SPACE METHODS; VISUALIZATION;

B-METHOD; FORMAL METHODS; MODEL CHECKING; TOOL SUPPORT;

ANIMATION;

EID: 24644521633     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11415787_2     Document Type: Conference Paper

References (24)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers -Principles, Techniques and Tools. Addison-Wesley, 1986.
3. F. Ambert, F. Bouquet, S. Chemin, S. Guenaud, B. Legeard, F. Peureux, M. Utting, and N. Vacelet. BZ-testing-tools: A tool-set for test generation from Z and B using constraint logic programming. In Proceedings of FATES'02, Formal Approaches to Testing of Software, pages 105-120, August 2002. Technical Report, INRIA.
4. AT&T Labs-Research. Graphviz - open source graph drawing software. Obtainable at http://www.research.att.com/sw/tools/graphviz/.
5. B-Core (UK) Limited, Oxon, UK. B-Toolkit, On-line manual., 1999. Available at http://www.b-core.com/ONLINEDOC/Contents.html.
6. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Proceedings of CAV'98, LNCS, pages 319-331. Springer-Verlag, 1998.
7. F. Bouquet, B. Legeard, and F. Peureux. CLPS-B - a constraint solver for B. In J.-P.Katoen and P.Stevens, editors, Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2280, pages 188-204. Springer-Verlag, 2002.
8. S. Casner and J. Larkin. Cognitive Efficiency Considerations for Good Graphic Design. In 11th Annual Conf. of the Cognitive Science Society, Ann Arbor, Michigan, August 1989.
9. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
10. H. W. F. Ham and J. Wijk. Visualization of State Transition Graphs. In IEEE Symposium on Information Visualization, pages 59-63, San Diego, CA, USA, October 2001.
11. M. Fitter and T. Green. When Do Diagrams Make Good Programming Languages? Int. Journal of Man-Machine Studies, pages 235-261, 1979.
12. J. Groote and F. Ham. Large State Space Visualization. In TACAS, volume 2619 of Lecture Notes in Computer Science, pages 585-590. Springer, 2003.
13. I. Herman, G. Melanon, and M. S. Marshall. Graph Visualization and Navigation in Information Visualization: A Survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24-43, 2000.
14. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
15. L. Ilie and S. Yu. Algorithms for Computing Small NFAs. In MFCS, volume 2420 of Lecture Notes in Computer Science. Springer, 2002.
16. T. Jiang and B. Ravikunar. Minimal NFA Problems are Hard. SIAM Journal on Computing, 22(6):1117-1141, 1993.
17. S. A. John. Minimal Unambigous ε-NFA. In 9th International Conference on Implementation and Application of Automata (CIAA-2004), Kingston, Ontario, Canada, July 2004.
18. 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.
19. M. Leuschel and E. Turner. Visualising larger states spaces in ProB. Technical report, School of Electronics and Computer Science, University of Southampton, January 2005.
20. A. Malcher. Minimizing Finite Automata is Computationally Hard. Springer-Verlag Berlin Heidelberg, 2710:386-397, August 2003.
21. N. L. N. Dulac, T. Viguier and M.-A. Storey. On the use of Visualization in Formal Requirements Specification. In IEEE Joint International Conference on Requirements Engineering, pages 71-81, Essen, Germany, September 2002.
22. V. Rusu and E. Singerman. On proving safety properties by integrating static analysis, theorem proving and abstraction". In Tools and Algorithms for the Construction and Analysis of Systems TACAS '99, LNCS. Springer-Verlag, 1999.
23. H. Sadi and N. Shankar. Abstract and model check while you prove. In Proceedings of CAV'99, LNCS, pages 319-331, Trento, Italy, July 1999. Springer-Verlag.
24. Steria, Aix-en-Provence, France. Atelier B, User and Reference Manuals, 1996. Available at http://www.atelierb.societe.com/index_uk.html.