Skip to main content

Testing of Abstract Components

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2010 (ICTAC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6255))

Included in the following conference series:

Abstract

In this paper, we present a conformance testing theory for Barbosa’s abstract components. We do so by defining a trace model for components from causal transfer functions which operate on data flows at discrete instants. This allows us to define a test selection strategy based on test purposes which are defined as subtrees of the execution tree built from the component traces. Moreover, we show in this paper that Barbosa’s definition of components is abstract enough to subsume a large family of state-based formalisms such as Mealy machines, Labeled Transition Systems and Input/Output Labeled Transition Systems. Hence, the conformance theory presented here is a generalization of the standard theories defined for different state-based formalisms and is a key step toward a theory of the test of heterogeneous systems.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Barbosa, L.S.: Towards a calculus of state-based software components. Journal of Universal Computer Science 9(8), 891–909 (2003)

    Google Scholar 

  2. Barr, M., Wells, C. (eds.): Category theory for computing science, 2nd edn. Prentice Hall International (UK) Ltd., Hertfordshire (1995)

    Google Scholar 

  3. Bernot, G.: Testing against formal specifications: A theoretical view. In: TAPSOFT 1991: Proc. of the Intl. Joint Conference on Theory and Practice of Software Development, London, UK, vol. 2, pp. 99–119. Springer, Heidelberg (1991)

    Google Scholar 

  4. Brinksma, E.: A theory for the derivation of tests. In: Proc. 8th Int. Conf. Protocol Specification, Testing, and Verification (PSTV VIII), pp. 63–74 (1988)

    Google Scholar 

  5. Briones, L., Brinksma, E.: A test generation framework for quiescent real-time systems. In: Grabowski, J., Nielsen, B. (eds.) FATES 2004. LNCS, vol. 3395, pp. 64–78. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Jéron, T., Jard, C.: TGV: theory, principles and algorithms. International Journal on Software Tools for Technology Transfer 7(4), 297–315 (2005)

    Article  Google Scholar 

  7. Fiadeiro, J.L.: Categories for Software Engineering. Springer, Heidelberg (2004)

    Google Scholar 

  8. Frantzen, L., Tretmans, J., Willemse, T.A.C.: A Symbolic Framework for Model-Based Testing. In: Havelund, K., Núñez, M., Roşu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol. 4262, pp. 40–54. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Gaston, C., Le Gall, P., Rapin, N., Touil, A.: Symbolic execution techniques for test purpose definition. In: Uyar, M.Ü., Duale, A.Y., Fecko, M.A. (eds.) TestCom 2006. LNCS, vol. 3964, pp. 1–18. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Jifeng, H., Hoare, C.A.R.: Unifying theories of programming. In: Orlowska, E., Szalas, A. (eds.) RelMiCS, pp. 97–99 (1998)

    Google Scholar 

  11. Hansen, H.H., Costa, D., Rutten, J.J.M.M.: Synthesis of mealy machines using derivatives. Electr. Notes Theor. Comput. Sci. (ENTCS) 164(1), 27–45 (2006)

    Article  MathSciNet  Google Scholar 

  12. Hardebolle, C., Boulanger, F.: Exploring multi-paradigm modeling techniques. SIMULATION: Transactions of the Society for Modeling and Simulation International 85(11/12), 688–708 (2009)

    Article  Google Scholar 

  13. Heerink, A.W., Tretmans, G.J.: Refusal testing for classes of transition systems with inputs and outputs. In: Mizuno, T., Shiratori, N., Higashino, T., Togashi, A. (eds.) Proceedings of the IFIP TC6 WG6.1 Joint Intl. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII). IFIP Conference Proceedings, vol. 107, pp. 23–38. Chapman & Hall, Boca Raton (1997)

    Google Scholar 

  14. Kanso, B., Aiguier, M., Boulanger, F., Touil, A.: Testing of abstract components. Internal Report 2010-05-28-DI-FBO, Supélec (2010), http://wwwdi.supelec.fr/

  15. Langerak, R.: A testing theory for LOTOS using deadlock detection. In: Brinksma, E., Scollo, G., Vissers, C.A. (eds.) Protocol Specification, Testing and Verification (PSTV), pp. 87–98. North-Holland, Amsterdam (1989)

    Google Scholar 

  16. Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines—a survey. Proceedings of the IEEE 84(8) (August 1996)

    Google Scholar 

  17. Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, Heidelberg (1971)

    MATH  Google Scholar 

  18. Mealy, G.H.: A method for synthesizing sequentiel circuits. Bell Systems Techn. Jour. (1955)

    Google Scholar 

  19. Meng, S., Barbosa, L.S.: Components as coalgebras: the refinement dimension. Theor. Comput. Sci. (TCS) 351(2), 276–294 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  20. Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)

    MATH  Google Scholar 

  21. Moggi, E.: Notions of computation and monads. Information and Computation 93, 55–92 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  22. De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Computer Science (TCS) 34(1-2), 83–133 (1984)

    Article  MATH  Google Scholar 

  23. Phillips, I.: Refusal testing. Theor. Comput. Sci. 50(3), 241–284 (1987)

    Article  MATH  Google Scholar 

  24. Sontag, E.D.: Mathematical control theory: deterministic finite dimensional systems, 2nd edn. Springer, New York (1998)

    MATH  Google Scholar 

  25. Tretmans, J.: A formal approach to conformance testing. In: Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI, pp. 257–276. North-Holland Publishing Co., Amsterdam (1994)

    Google Scholar 

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

    MATH  Google Scholar 

  27. Weilghofer, M., Aichernig, B.: Unifying input output conformance. In: Butterfield, A. (ed.) UTP 2008. LNCS, vol. 5713, pp. 181–201. Springer, Heidelberg (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanso, B., Aiguier, M., Boulanger, F., Touil, A. (2010). Testing of Abstract Components. In: Cavalcanti, A., Deharbe, D., Gaudel, MC., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2010. ICTAC 2010. Lecture Notes in Computer Science, vol 6255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14808-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14808-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14807-1

  • Online ISBN: 978-3-642-14808-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics