Skip to main content

Faster Analysis of Formal Specifications

  • Conference paper
Formal Methods and Software Engineering (ICFEM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3308))

Included in the following conference series:

Abstract

When animating a formal model for validation or test generation purposes, scalability is a key issue. This paper describes a graph-based representation for the operations of state-based formal models. This representation makes it possible to handle large models efficiently and perform a variety of transformations, such as splitting an operation into separate behaviours, implementing various test coverage criteria for complex conditionals, removing inconsistent paths, factoring out common calculations, and executing the final operation using a customized constraint logic programming solver. The result is a fully automatic execution engine for state-based formal models such as B [Abr96], Z [Spi92] and UML with OCL preconditions and postconditions. It can be used for animation, test generation and other verification or validation purposes. Our experimental results on large industrial applications show that the transformations result in significant speedups.

This work is partially supported by Schlumberger/Axalto Smart Card R&D and by PSA Peugeot Citroën.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Bezem, M.A.: Formulas as programs. In: Centrum voor Wiskunde en Informatica (CWI), 194, p. 26 (1998) ISSN 1386-3711, 31

    Google Scholar 

  2. Ambert, F., Bouquet, F., Chemin, S., Guenaud, S., Legeard, B., Peureux, F., Vacelet, N., Utting, M.: BZ-TT: A tool-set for test generation from Z and B using constraint logic programming. In: Proceedings of the CONCUR 2002, Workshop on Formal Approaches to Testing of Software (FATES 2002), Brnö, Czech Republic, August 2002, pp. 105–120 (2002), INRIA Technical Report (2002)

    Google Scholar 

  3. Van Aertryck, L., Benveniste, M., le Metayer, D.: CASTING: a formally based software test generation method. In: 1st IEEE International Conference on Formal Engineering Methods (ICFEM 1997), pp. 99–112 (1997)

    Google Scholar 

  4. Abrial, J.-R.: The B-BOOK: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996) ISBN 0 521 49619 5

    Book  MATH  Google Scholar 

  5. Bernard, E., Legeard, B., Luck, X., Peureux, F.: Generation of test sequences from formal specifications: GSM 11.11 standard case-study. The Journal of Software Practice and Experience (accepted for publication, 2004)

    Google Scholar 

  6. Bouquet, F., Legeard, B., Peureux, F.: CLPS-B – A constraint solver for B. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 188–204. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Bryant, R.E.: Graph-based algorithms for boolean function manipulatio. IEEE Transactions on Computers C-35(8), 677–691 (1986)

    Article  Google Scholar 

  8. The BZ-TT web site (September 2003), http://lifc.univ-fcomte.fr/~bztt

  9. Emv 2000 specifications version 4.0 (December 2000) http://www.emvco.com

  10. Common electronic purse specifications version 2.3 (March 2001), http://www.cepsco.com

  11. Cassandra, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publisher, Dordrecht (1999)

    Google Scholar 

  12. Colin, S., Legeard, B., Peureux, F.: Preamble computation in automated test generation using Constraint Logic Programming. In: Proceedings of UK-Test Workshop, York, UK (September 2003)

    Google Scholar 

  13. Dick, J., Faivre, A.: Automating the generation and sequencing of test cases from model-based specifications. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol. 670, pp. 268–284. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  14. Delzanno, G., Podelski, A.: Model Checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 223–239. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Gupta, R., Berson, D.A., Fang, J.Z.: Path profile guided partial dead code elimation using predication. In: International Conference on Parallel Architectures and Compilation Techniques, November 10–14, pp. 102–113 (1997)

    Google Scholar 

  16. Gotlieb, A., Botella, B., Rueher, M.: A CLP framework for computing structural test data. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol. 1861, pp. 399–413. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Grieskamp, W.: A computation model for Z based on concurrent constraint resolution. In: P. Bowen, J., Dunne, S., Galloway, A., King, S. (eds.) B 2000, ZUM 2000, and ZB 2000. LNCS, vol. 1878, pp. 414–432. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Legeard, B., Bouquet, F., Lebeau, F.: Automated Test Generation and Execution for Automtive Embeded Software. In: International Council on Systems Engineering (ed.), INCOSE 2004, Annual International Symposium 4th European Systems Engineering Conference, June 20-24 (to appear, 2004)

    Google Scholar 

  19. The Leirios web site (September 2003), http://www.leirios.com

  20. Legeard, B., Peureux, F., Utting, M.: Automated Boundary Testing from Z and B. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 21–40. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Legeard, B., Peureux, F., Utting, M.: Controlling test case explosion in test generation from b formal models. The Journal of Software Testing, Verification and Reliability 14(2), 1–23 (to appear, 2004)

    Google Scholar 

  22. Marre, B., Arnould, A.: Test Sequence generation from Lustre descriptions: GATEL. In: Proceedings of the 15th International Conference on Automated Software Engineering (ASE 2000), Grenoble, France, pp. 229–237. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  23. Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  24. Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual, Addison-wesley edition (1999)

    Google Scholar 

  25. Spivey, J.M.: The Z notation: A Reference Manual, 2nd edn. Prentice-Hall, Englewood Cliffs (1992) ISBN 0 13 978529 9

    Google Scholar 

  26. Warmer, J., Kleppe, A.: The Object Constraint Language: Precise Modeling with UML. Addison-Wesley, Reading (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouquet, F., Legeard, B., Utting, M., Vacelet, N. (2004). Faster Analysis of Formal Specifications. In: Davies, J., Schulte, W., Barnett, M. (eds) Formal Methods and Software Engineering. ICFEM 2004. Lecture Notes in Computer Science, vol 3308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30482-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30482-1_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23841-6

  • Online ISBN: 978-3-540-30482-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics