Skip to main content

Automatic Testing from Formal Specifications

  • Conference paper
Tests and Proofs (TAP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4454))

Included in the following conference series:

Abstract

In this article, we consider model oriented formal specification languages. We generate test cases by performing symbolic execution over a model, and from the test cases obtain a Java program. This Java program acts as a test driver and when it is run in conjunction with the implementation then testing is performed in an automatic manner. Our approach makes the testing cycle fully automatic. The main contribution of our work is that we perform automatic testing even when the models are non-deterministic.

Work done within the EU research project Rodin, IST 511599.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abrial, J.-R.: The B–Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

  2. Bernard, E., Legeard, B., Luck, X., Peureux, F.: Generation of test sequences from formal specifications: GSM 11-11 standard case study. Software Practice and Experience 34(10), 915–948 (2004)

    Article  Google Scholar 

  3. Colin, S., Legeard, B., Peureux, F.: Preamble computation in automated test case generation using constraint logic programming. Software Testing Verification and Reliability, John Wiley 14, 213–235 (2004)

    Article  Google Scholar 

  4. 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 

  5. Dalal, S.R., Jain, A., Karunanithi, N., Leaton, J.M., Lott, C.M., Patton, G.C., Horowitz, B.M.: Model Based Testing in Practice. In: Proc. of ICSE 1999 (1999)

    Google Scholar 

  6. El-Far, I.K., Whittaker, J.A.: Model Based Software Testing. In: Marciniak, J.J. (ed.) Encyclopedia on Software Engineering, John Wiley, Chichester (2001)

    Google Scholar 

  7. Gannon, J.D., Hamlet, R.G., Mills, H.D.: Theory of modules. IEEE Transactions on Software Engineering 13(7), 820–829 (1987)

    Article  MATH  Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  9. Gurevich, Y.: Sequential Abstract-State Machines Capture Sequential Programs. ACM Transaction on Computational Logic 1(1), 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  10. Hierons, R.M.: Testing from a Non-deterministic Finite State Machine using Adaptive State Counting. IEEE Transactions on Computers 53(10), 1330–1342 (2004)

    Article  Google Scholar 

  11. Hierons, R.M.: Applying Adaptive Test Cases to Non-deterministic Implementations. Information Processing Letters 98(2006), 56–60 (2006)

    Article  MathSciNet  Google Scholar 

  12. Jones, C.B.: Systematic Software Development using VDM, 2nd edn. Prentice-Hall, Englewood Cliffs (1990)

    MATH  Google Scholar 

  13. Lee, D., Yannakakis, M.: Principles and Methods of Testing Finite State Machines: A survey. Proc. of the IEEE 80(8), 1090–1123 (1996)

    Article  Google Scholar 

  14. Legeard, B., Peureux, F., Utting, M.: Automatic 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 

  15. Legeard, B., Peureux, F., Utting, M.: Controlling test case explosion in test generation from B formal models, Software Testing, Verification and Reliability, pp. 81–103. John Wiley, Chichester (2004)

    Google Scholar 

  16. Leuschel, M., Butler, M.: ProB: A Model Checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855–874. Springer, Heidelberg (2003)

    Google Scholar 

  17. Nachmanson, L., Veanes, M., Schulte, W., Tillmann, N., Grieskamp, W.: Optimal Strategies for Testing Nondeterministic Systems. In: ACM ISSTA 2004, Boston, ACM Press, New York (2004)

    Google Scholar 

  18. Panzl, D.J.: Automatic Software Test Drivers. IEEE Computer 11(4) (1978)

    Google Scholar 

  19. Richardson, D.J., Leif Aha, A., O’Malley, T.O.: Specification-based Test Oracles for Reactive Systems. In: Proc. of the 14th ICSE, Melbourne, pp. 105–118 (1992)

    Google Scholar 

  20. Satpathy, M., Butler, M., Ramesh, S., Leuschel, M.: Automatic Testing of Formal Specifications, Technical Report 792, Abo Akademi University, Turku, Finland (2006), available at: http://www.tucs.fi/publications

  21. Satpathy, M., Leuschel, M., Butler, M.: ProTest: An Automatic Test Environment for B Specifications. Electronic Notes on TCS (ENTCS) 111, 113–136 (2005)

    Article  Google Scholar 

  22. Spivey, J.M.: Understanding Z. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  23. Yannakakis, M., Lee, D.: Testing Finite State Machines: Fault Detection. Journal of Computer and System Sciences 50, 209–277 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  24. Zhang, F., Cheung, T.: Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite State Machines. IEEE Transactions on Software Engineering 29(1), 1–14 (2003)

    Article  Google Scholar 

  25. Zhu, H., Hall, P.A.V., May, J.H.R.: Software Unit Test Coverage and Adequacy. ACM Computing Surveys 29(4), 366–427 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yuri Gurevich Bertrand Meyer

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Satpathy, M., Butler, M., Leuschel, M., Ramesh, S. (2007). Automatic Testing from Formal Specifications. In: Gurevich, Y., Meyer, B. (eds) Tests and Proofs. TAP 2007. Lecture Notes in Computer Science, vol 4454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73770-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73770-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73769-8

  • Online ISBN: 978-3-540-73770-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics