Testing of abstract components

  • Authors:
  • Bilal Kanso;Marc Aiguier;Frédéric Boulanger;Assia Touil

  • Affiliations:
  • École Centrale Paris, Laboratoire de Mathématiques Appliquées aux Systèmes, Châtenay-Malabry and SUPELEC Systems Sciences, Computer Science Department, Gif-sur-Yvette cede ...;École Centrale Paris, Laboratoire de Mathématiques Appliquées aux Systèmes, Châtenay-Malabry;SUPELEC Systems Sciences, Computer Science Department, Gif-sur-Yvette cedex;SUPELEC Systems Sciences, Computer Science Department, Gif-sur-Yvette cedex

  • Venue:
  • ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.