Skip to main content
SpringerLink
Log in

Testing Concurrent Systems: A Formal Approach

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

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

Included in the following conference series:

Abstract

This paper discusses the use of formal methods in testing of concurrent systems. It is argued that formal methods and testing can be mutually profitable and useful. A framework for testing based on formal specifications is presented. This framework is elaborated for labelled transition systems, providing formal definitions of conformance, test execution and test derivation. A test derivation algorithm is given and its tool implementation is briefly discussed.

This research is supported by the Dutch Technology Foundation STW under project STW TIF.4111: Côte de Resyste { COnformance TEsting of REactive SYSTEms; URL: http://fmt.cs.utwente.nl/CdR.

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. S. Abramsky. Observational equivalence as a testing equivalence. Theoretical Computer Science, 53(3):225–241, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Alderden. COOPER, the compositional construction of a canonical tester. In S. T. Vuong, editor, FORTE’89, pages 13–17. North-Holland, 1990.

    Google Scholar 

  3. B. Beizer. Software Testing Techniques. Van Nostrand Reinhold, 1990.

    Google Scholar 

  4. A. Belinfante, J. Feenstra, R. G. de Vries, J. Tretmans, N. Goga, L. Feijs, S. Mauw, and L. Heerink. Formal test automation: A simple experiment. In G. Csopaki, S. Dibuz, and K. Tarnay, editors, 12th Int.Workshop on Testing of Communicating Systems. Kluwer Academic Publishers, 1999.

    Google Scholar 

  5. J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77–121, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Bernot. Testing against formal specifications: A theoretical view. In S. Abramsky and T. S. E. Maibaum, editors, TAPSOFT’91, Volume 2, pages 99–119. Lecture Notes in Computer Science 494, Springer-Verlag, 1991.

    Google Scholar 

  7. B. S. Bosik and M. Ü. Uyar. Finite state machine based formal methods in protocol conformance testing: From theory to implementation. Computer Networks and ISDN Systems, 22(1):7–33, 1991.

    Article  Google Scholar 

  8. E. Brinksma. A theory for the derivation of tests. In S. Aggarwal and K. Sabnani, editors, Protocol Specification, Testing, and Verification VIII, pages 63–74. NorthHolland, 1988.

    Google Scholar 

  9. E. Brinksma. On the coverage of partial validations. In M. Nivat, C. M. I. Rattray, T. Rus, and G. Scollo, editors, AMAST’93, pages 247–254. BCS-FACS Workshops in Computing Series, Springer-Verlag, 1993.

    Google Scholar 

  10. E. Brinksma, R. Alderden, R. Langerak, J. van de Lagemaat, and J. Tretmans. A formal approach to conformance testing. In J. de Meer, L. Mackert, and W. Effelsberg, editors, Second Int. Workshop on Protocol Test Systems, pages 349–363. North-Holland, 1990.

    Google Scholar 

  11. E. Brinksma, G. Scollo, and C. Steenbergen. LOTOS specifications, their implementations and their tests. In G. von Bochmann and B. Sarikaya, editors, Protocol Specification, Testing, and Verification VI, pages 349–360. North-Holland, 1987.

    Google Scholar 

  12. CCITT. Specification and Description Language (SDL). Recommendation Z.100. ITU-T General Secretariat, Geneve, Switzerland, 1992.

    Google Scholar 

  13. M. Clatin. Manuel d’utilisation de TVEDA V3. Manual LAA/EIA/EVP/109, France Télécom CNET LAA/EIA/EVP, Lannion, France, 1996.

    Google Scholar 

  14. R. De Nicola. Extensional equivalences for transition systems. Acta Informatica, 24:211–237, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  15. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  16. K. Drira. The refusal graph: a tradeoff between verification and test. In O. Rafiq, editor, Sixth Int. Workshop on Protocol Test Systems, pages 297–312. NorthHolland, 1994.

    Google Scholar 

  17. H. Eertink. The implementation of a test derivation algorithm. Memorandum INF-87-36, University of Twente, Enschede, The Netherlands, 1987.

    Google Scholar 

  18. J.-C. Fernandez, C. Jard, T. Jéron, and C. Viho. An experiment in automatic generation of test suites for protocols with verification technology. Science of Computer Programming-Special Issue on COST247, Verification and Validation Methods for Formal Descriptions, 29(1-2):123–146, 1997.

    Google Scholar 

  19. L. Ferreira Pires. Protocol implementation: Manual for practical exercises 1995/1996. Lecture notes, University of Twente, Enschede, The Netherlands, August 1995.

    Google Scholar 

  20. H. Garavel. Open/Cæsar21. M.-C. Gaudel. Testing can be formal, too. In P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, TAPSOFT’95: Theory and Practice of Software Development, pages 82–96. Lecture Notes in Computer Science 915, Springer-Verlag, 1995.

    Google Scholar 

  21. W. Geurts, K. Wijbrans, and J. Tretmans. Testing and formal methods — Bos project case study. In EuroSTAR’98: 6th European Int. Conference on Software Testing, Analysis & Review, pages 215–229, Munich, Germany, November 30–December 1 1998.

    Google Scholar 

  22. R. J. van Glabbeek. The linear time-branching time spectrum. In J. C. M. Baeten and J. W. Klop, editors, CONCUR’90, Lecture Notes in Computer Science 458, pages 278–297. Springer-Verlag, 1990.

    Google Scholar 

  23. R. J. van Glabbeek. The linear time-branching time spectrum II (The semantics of sequential systems with silent moves). In E. Best, editor, CONCUR’93, Lecture Notes in Computer Science 715, pages 66–81. Springer-Verlag, 1993.

    Google Scholar 

  24. L. Heerink. Ins and Outs in Refusal Testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1998.

    Google Scholar 

  25. L. Heerink and J. Tretmans. Formal methods in conformance testing: A probabilistic refinement. In B. Baumgarten, H.-J. Burkhardt, and A. Giessler, editors, Ninth Int. Workshop on Testing of Communicating Systems, pages 261–276. Chapman & Hall, 1996.

    Google Scholar 

  26. L. Heerink and J. Tretmans. Refusal testing for classes of transition systems with inputs and outputs. In T. Mizuno, N. Shiratori, T. Higashino, and A. Togashi, editors, Formal Desciption Techniques and Protocol Specification, Testing and Verification FORTE X /PSTV XVII’ 97, pages 23–38. Chapman & Hall, 1997.

    Google Scholar 

  27. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  28. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall Inc., 1991.

    Google Scholar 

  29. ISO. Information Processing Systems, Open Systems Interconnection, LOTOS-A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard IS-8807. ISO, Geneve, 1989.

    Google Scholar 

  30. ISO. Information Technology, Open Systems Interconnection, Conformance Testing Methodology and Framework. International Standard IS-9646. ISO, Geneve, 1991. Also: CCITT X.290-X.294.

    Google Scholar 

  31. ISO/IEC JTC1/SC21 WG7, ITU-T SG 10/Q.8. Information Retrieval, Transfer and Management for OSI; Framework: Formal Methods in Conformance Testing. Committee Draft CD 13245-1, ITU-T proposed recommendation Z.500. ISO-ITUT, Geneve, 1996.

    Google Scholar 

  32. R. Langerak. A testing theory for LOTOS using deadlock detection. In E. Brinksma, G. Scollo, and C. A. Vissers, editors, Protocol Specification, Testing, and Verification IX, pages 87–98. North-Holland, 1990.

    Google Scholar 

  33. G. Leduc. A framework based on implementation relations for implementing LOTOS specifications. Computer Networks and ISDN Systems, 25(1):23–41, 1992.

    Article  MATH  Google Scholar 

  34. D. Lee and M. Yannakakis. Principles and methods for testing finite state machines. The Proceedings of the IEEE, August 1996.

    Google Scholar 

  35. N. A. Lynch and M. R. Tuttle. An introduction to Input/Output Automata. CWI Quarterly, 2(3):219–246, 1989.

    MATH  MathSciNet  Google Scholar 

  36. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  37. G. J. Myers. The Art of Software Testing. John Wiley & Sons Inc, 1979.

    Google Scholar 

  38. M. Phalippou. Relations d’Implantation et Hypothéses de Test sur des Automates à Entrées et Sorties. PhD thesis, L’Université de Bordeaux I, France, 1994.

    Google Scholar 

  39. I. Phillips. Refusal testing. Theoretical Computer Science, 50(2):241–284, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  40. D. H. Pitt and D. Freestone. The derivation of conformance tests from LOTOS specifications. IEEE Transactions on Software Engineering, 16(12):1337–1343, 1990.

    Article  Google Scholar 

  41. R. Segala. Quiescence, fairness, testing, and the notion of implementation. In E. Best, editor, CONCUR’93, pages 324–338. Lecture Notes in Computer Science 715, Springer-Verlag, 1993.

    Google Scholar 

  42. Telelogic. Tau SDL Tool Set Documentation. Telelogic AB, Malmö, Sweden, 1998.

    Google Scholar 

  43. J. Tretmans. A formal approach to conformance testing. In O. Rafiq, editor, Sixth Int. Workshop on Protocol Test Systems, number C-19 in IFIP Transactions, pages 257–276. North-Holland, 1994.

    Google Scholar 

  44. J. Tretmans. Test generation with inputs, outputs and repetitive quiescence. Software—Concepts and Tools, 17(3):103–120, 1996.

    MATH  Google Scholar 

  45. F. Vaandrager. On the relationship between process algebra and Input/Output Automata. In Logic in Computer Science, pages 387–398. Sixth Annual IEEE Symposium, IEEE Computer Society Press, 1991.

    Google Scholar 

  46. L. Verhaard, J. Tretmans, P. Kars, and E. Brinksma. On asynchronous testing. In G. von Bochmann, R. Dssouli, and A. Das, editors, Fifth Int. Workshop on Protocol Test Systems, IFIP Transactions. North-Holland, 1993.

    Google Scholar 

  47. R. G. de Vries and J. Tretmans. On-the-Fly Conformance Testing using Spin. In G. Holzmann, E. Najm, and A. Serhrouchni, editors, Fourth Workshop on Automata Theoretic Verification with the Spin Model Checker, ENST 98 S 002, pages 115–128, Paris, France, November 2 1998. Ecole Nationale Supérieure des Télécommunications. Also to appear in Software Tools for Technology Transfer.

    Google Scholar 

  48. C. D. Wezeman. The CO-OP method for compositional derivation of conformance testers. In E. Brinksma, G. Scollo, and C. A. Vissers, editors, Protocol Specification, Testing, and Verification IX, pages 145–158. North-Holland, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Formal Methods and Tools research group, University of Twente, P.O. Box 217, 7500, AE Enschede, The Netherlands

    Jan Tretmans

Authors
  1. Jan Tretmans
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tretmans, J. (1999). Testing Concurrent Systems: A Formal Approach. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation