Skip to main content

Compositional Verification of Input-Output Conformance via CSP Refinement Checking

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

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

Included in the following conference series:

Abstract

This paper contributes to a testing theory, based on the CSP process algebra, whose conformance relation (cspio) distinguishes input and output events. Although cspio has been defined in terms of the standard CSP traces model, we show that our theory can be immediately extended to address deadlock, outputlock and livelock situations if a special output event is used to represent quiescence. This is formally established by showing that this broader view of cspio is equivalent to Tretmans’ ioco relation. Furthermore, we address compositional conformance verification, establishing compositionality properties for cspio with respect to process composition operators. Our testing theory has been adopted in an industrial context involving a collaboration with Motorola, whose focus is on the testing of mobile applications. Some examples are presented to illustrate the overall approach.

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. Abrial, J.-R.: The B-book: assigning programs to meanings. Cambridge University Press, New York (1996)

    MATH  Google Scholar 

  2. Aichernig, B.K., Delgado, C.C.: From faults via test purposes to test cases: On the fault-based testing of concurrent systems. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 324–338. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Aichernig, B.K., Weiglhofer, M., Wotawa, F.: Improving fault-based conformance testing. ENTCS 220(1), 63–77 (2008)

    Google Scholar 

  4. Ball, T.: Automated abstraction of software. In: Automated Technology for Verification and Analysis, Springer, Heidelberg (2006)

    Google Scholar 

  5. Belinfante, A., Feenstra, J., de Vries, R.G., Tretmans, J., Goga, N., Feijs, L.M.G., Mauw, S., Heerink, L.: Formal test automation: A simple experiment. In: Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems, pp. 179–196. Kluwer, B.V (1999)

    Google Scholar 

  6. Cabral, G., Sampaio, A.: Formal Specification Generation from Requirement Documents. ENTCS 195, 171–188 (2008)

    Google Scholar 

  7. Cavalcanti, A., Gaudel, M.-C.: Testing for Refinement in CSP. In: Butler, M., Hinchey, M.G., Larrondo-Petrie, M.M. (eds.) ICFEM 2007. LNCS, vol. 4789, pp. 151–170. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions Programming Languages Systems 8(2), 244–263 (1986)

    Article  MATH  Google Scholar 

  9. Gaudel, M.-C.: Testing Can Be Formal, Too. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 82–96. Springer, Heidelberg (1995)

    Google Scholar 

  10. Godefroid, P.: Compositional dynamic test generation. SIGPLAN Notices 42(1), 47–54 (2007)

    Article  Google Scholar 

  11. Gotzhein, R., Khendek, F.: Compositional testing of communication systems. In: Uyar, M.Ü., Duale, A.Y., Fecko, M.A. (eds.) TestCom 2006. LNCS, vol. 3964, pp. 227–244. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  13. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  14. Isobe, Y., Roggenbach, M.: A Generic Theorem Prover of CSP Refinement. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 108–123. Springer, Heidelberg (2005)

    Google Scholar 

  15. Jard, C., Jéron, T.: TGV: theory, principles and algorithms: A tool for the automatic synthesis of conformance test cases for non-deterministic reactive systems. International Journal on Software Tools for Technology Transfer 7(4), 297–315 (2005)

    Article  Google Scholar 

  16. Jones, C.B.: Systematic software development using VDM, 2nd edn. Prentice-Hall, Inc., Upper Saddle River (1990)

    MATH  Google Scholar 

  17. Formal Systems. Failures-Divergence Refinement - FDR2 User Manual. Formal Systems (Europe) Ltd (June 2005)

    Google Scholar 

  18. Nogueira, S., Sampaio, A., Mota, A.: Guided Test Generation from CSP Models. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 258–273. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Peleska, J., Siegel, M.: Test automation of safety-critical reactive systems. South African Computer Journal 19, 53–77 (1997)

    Google Scholar 

  20. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall PTR, Englewood Cliffs (1997)

    Google Scholar 

  21. Schneider, S.: Abstraction and testing. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 738–757. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  22. Schneider, S.: Concurrent and Real Time Systems: The CSP Approach (Worldwide Series in Computer Science). John Wiley & Sons, Chichester (1999)

    Google Scholar 

  23. Torres, D., Leitão, D., Barros, F.A.: Motorola SpecNL: A Hybrid System to Generate NL Descriptions from Test Case Specifications. HIS, 45 (2006)

    Google Scholar 

  24. Tretmans, J.: Test Generation with Inputs, Outputs and Repetitive Quiescence. Software—Concepts and Tools 17(3), 103–120 (1996)

    MATH  Google Scholar 

  25. Tretmans, J.: Testing concurrent systems: A formal approach. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 46–65. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  26. van der Bijl, M., Peureux, F.: 7 I/O-automata Based Testing. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 173–200. Springer, Heidelberg (2005)

    Google Scholar 

  27. van der Bijl, M., Rensink, A., Tretmans, J.: Compositional testing with ioco. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 86–100. Springer, Heidelberg (2004)

    Google Scholar 

  28. Weiglhofer, M., Aichernig, B.: Unifying input output conformance. In: Proceedings of the 2nd International Symposium on Unifying Theories of Programming. LNCS, vol. 5713. Springer, Heidelberg (2008)

    Google Scholar 

  29. Weiglhofer, M., Wotawa, F.: On the fly input output conformance verification. In: Proceedings of the IASTED International Conference on Software Engineering, Innsbruck, Austria, pp. 286–291. ACTA Press (2008)

    Google Scholar 

  30. Woodcock, J., Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice Hall International, Englewood Cliffs (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sampaio, A., Nogueira, S., Mota, A. (2009). Compositional Verification of Input-Output Conformance via CSP Refinement Checking. In: Breitman, K., Cavalcanti, A. (eds) Formal Methods and Software Engineering. ICFEM 2009. Lecture Notes in Computer Science, vol 5885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10373-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10373-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10372-8

  • Online ISBN: 978-3-642-10373-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics