Skip to main content
SpringerLink
Log in

Automatically Generating Information from a Z Specification to Support the Classification Tree Method

  • Conference paper
  • First Online:
ZB 2003: Formal Specification and Development in Z and B (ZB 2003)

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

Included in the following conference series:

Abstract

The Classification Tree Method provides a flexible basis for systematic testing. Traditionally the generation of a classification tree has been entirely manual. This paper introduces a new approach that extracts predicates from the Z specification of an operation and builds a Classification Tree from these predicates. It thus shows how the generation of a Classification Tree may be semi-automated on the basis of a Z specification. The paper also defines the notion of the test context of a predicate that determines when the value of this predicate is relevant. The test context is used to reduce the number of tests produced from the Classification Tree.

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

Access this chapter

Log in via an institution
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. N. Amla and P. Ammann. Using Z specifications in category partition testing. In COMPASS’ 92, Seventh Annual Conference on Computer Assurance, pages 15–18, Gaithersburg, MD, USA, 1992.

    Google Scholar 

  2. T. Y. Chen and P. L. Poon. Construction of classification trees via the classification-hierarchy table. Information and Software Technology, 39:889–896, 1997.

    Article  Google Scholar 

  3. T. Y. Chen and P. L. Poon. On the effectiveness of classification trees for test case construction. Information and Software Technology, 40:765–775, 1998.

    Article  Google Scholar 

  4. J. Derrick and E. Boiten. Testing refinements of state-based formal specifications. Journal of Software Testing, Verification, and Reliability, 9:27–50, 1999.

    Article  Google Scholar 

  5. J. Dick and A. Faivre. Automating the generation and sequencing of test cases from model-based specifications. In FME’ 93, First International Symposium on Formal Methods in Europe, pages 268–284, Odense, Denmark, 19–23 April 1993. Springer-Verlag, Lecture Notes in Computer Science 670.

    Google Scholar 

  6. M. C. Gaudel. Testing can be formal too. In TAPSOFT’95, pages 82–96. Springer-Verlag, March 1995.

    Google Scholar 

  7. M. Grochtmann and K. Grimm. Classification trees for partition testing. Journal of Software Testing, Verification and Reliability, 3:63–82, 1993.

    Article  Google Scholar 

  8. P. A. V. Hall and R. M. Hierons. Formal Methods and Testing. Technical Report 91/16, Computing Department, The Open University, August 1991.

    Google Scholar 

  9. R. M. Hierons. Testing from a Z specification. Journal of Software Testing, Verification and Reliability, 7:19–33, 1997.

    Article  Google Scholar 

  10. R. M. Hierons and M. Harman. Testing comformance to a quasi-non-determinstic stream X-machine. Formal Aspects of Computing, 12:423–442, 2000.

    Article  MATH  Google Scholar 

  11. R. M. Hierons, S. Sadeghipour, and H. Singh. Testing a system specified using statecharts and Z. Information and Software Technology, 43:137–149, 2001.

    Article  Google Scholar 

  12. R. M. Hierons and H. Ural. Reduced length checking sequences. IEEE Transactions on Computers, 51: 1111–1117, 2002.

    Article  MathSciNet  Google Scholar 

  13. C. A. R. Hoare. How did software get so reliable without proof? In Proceedings of Formal Methods Europe, 96 (Lecture Notes in Computer Science 1051), pages 1–17. Springer-Verlag, 1996.

    Google Scholar 

  14. M. Holcombe and F. Ipate. Correct Systems: Building a Business Process Solution. Springer-Verlag, 1998.

    Google Scholar 

  15. G. Laycock. Formal specification and testing: A case study. Journal of Software Testing, Verification and Reliability, 2:7–23, 1992.

    Article  Google Scholar 

  16. D. Lee and M. Yannakakis. Principles and methods of testing finite-state machines. Proceedings of the IEEE, 84:1089–1123, 1996.

    Article  Google Scholar 

  17. H. Singh, M. Conrad, and S. Sadeghipour. Test case design based on Z and the classification-tree method. In First IEEE Conference on Formal Engineering Methods, pages 81–90, Hiroshima, Japan, November 1997. IEEE Computer Society.

    Google Scholar 

  18. P. Stocks and D. Carrington. A Framework for Specification-Based Testing. IEEE Transactions on Software Engineering, 2:777–793, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK

    Robert M. Hierons & Mark Harman

  2. Research Information and Communication Software Technology Research Lab (RIC/SM), DaimlerChrysler AG, Alt-Moabit 96a, D-10559, Berlin, Germany

    Harbhajan Singh

Authors
  1. Robert M. Hierons
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Harman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Harbhajan Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire LSR-IMAG, CNRS, 681, rue de la Passerelle, BP 72, 38402, Saint-Martin-d’Heres Cedex, France

    Didier Bert

  2. CISM, London South Bank University, Borough Road, London, SE1 0AA, UK

    Jonathan P. Bowen

  3. Department of Computer Science, University of York, Heslington, York, YO10 5DD, UK

    Steve King

  4. Department of Computer Science, Åbo Akademi University, Lemminkäineng. 14 A, 20520, Turku, Finland

    Marina Waldén

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hierons, R.M., Harman, M., Singh, H. (2003). Automatically Generating Information from a Z Specification to Support the Classification Tree Method. In: Bert, D., Bowen, J.P., King, S., Waldén, M. (eds) ZB 2003: Formal Specification and Development in Z and B. ZB 2003. Lecture Notes in Computer Science, vol 2651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44880-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44880-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40253-4

  • Online ISBN: 978-3-540-44880-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation