Instantiation of Parameterized Data Structures for Model-Based Testing

  • Fabrice Bouquet
  • Jean-François Couchot
  • Frédéric Dadeau
  • Alain Giorgetti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4355)


Model-based testing is bound, by essence, to use the enumerated data structures of the system under test (SUT). On the other hand, formal modeling often involves the use of parameterized data structures in order to be more general (such a model should be sufficient to test many implementation variants) and to abstract irrelevant details. Consequently, the validation engineer is sooner or later required to instantiate these parameters. At the current time, this instantiation activity is a matter of experience and knowledge of the SUT. This work investigates how to rationalize the instantiation of the model parameters.

It is obvious that a poor instantiation may badly influence the quality of the resulting tests. However, recent results in instantiation-based theorem proving and their application to software verification show that it is often possible to guess the smallest most general data enumeration. We first provide a formal characterization of what a most general instantiation is, in the framework of functional testing. Then, we propose an approach to automate the instantiation of the model parameters, which leaves the specifier and the validation engineer free to use the desired level of abstraction, during the model design process, without having to satisfy any finiteness requirement.

We investigate cases where delaying the instantiation is not a problem. This work is illustrated by a realistic running example. It is presented in the framework of the BZ-Testing-Tools methodology, which uses a B abstract machine for model-based testing and targets many implementation languages.


Proof Obligation Coverage Criterion System Under Test Test Target Decision Coverage 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ambert, F., Bouquet, F., Chemin, S., Guenaud, S., Legeard, B., Peureux, F., Vacelet, N., Utting, M.: BZ-TT: A Tool-Set for Test Generation from Z and B using Contraint Logic Programming. In: Formal Approaches to Testing of Software, FATES 2002 workshop of CONCUR 2002, pp. 105–120 (2002)Google Scholar
  2. 2.
    Bernard, E., Legeard, B., Luck, X., Peureux, F.: Generation of test sequences from formal specifications: GSM 11-11 standard case study. International Journal of Software Practice and Experience 34(10), 915–948 (2004)CrossRefGoogle Scholar
  3. 3.
    Bouquet, F., Legeard, B., Peureux, F.: CLPS-B: A constraint solver to animate a B specification. International Journal on Software Tools for Technology Transfer, STTT 6(2), 143–157 (2004)Google Scholar
  4. 4.
    Boyapati, C., Khurshid, S., Marinov, D.: Korat: automated testing based on java predicates. In: ISSTA 2002: Proceedings of the ACM SIGSOFT international symposium on Software testing and analysis, pp. 123–133. ACM Press, New York (2002)CrossRefGoogle Scholar
  5. 5.
    Couchot, J.-F., Déharbe, D., Giorgetti, A., Ranise, S.: Scalable automated proving and debugging of set-based specifications. Journal of the Brazilian Computer Society (JBCS) 9(2), 17–36 (2003)Google Scholar
  6. 6.
    Déharbe, D., Ranise, S.: Applying light-weight theorem proving to debugging and verifying pointer programs. ENTCS, vol. 86. Elsevier, Amsterdam (2003)Google Scholar
  7. 7.
    El-Far, I.K., Whittaker, J.A.: Model-based software testing. Encyclopedia of Software Engineering 1, 825–837 (2002)Google Scholar
  8. 8.
    European Telecommunications Standards Institute. GSM Technical Specification (1995),
  9. 9.
    Fontaine, P., Gribomont, E.P.: Decidability of invariant validation for parameterized systems. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 97–112. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Leuschel, M., Butler, M.: ProB: A model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855–874. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Offutt, A.J., Xiong, Y., Liu, S.: Criteria for generating specification-based tests. In: 5th International Conference on Engineering of Complex Computer Systems (ICECCS 1999), p. 119. IEEE Computer Society, Los Alamitos (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Fabrice Bouquet
    • 1
  • Jean-François Couchot
    • 1
  • Frédéric Dadeau
    • 1
  • Alain Giorgetti
    • 1
  1. 1.LIFC – INRIA Cassis project, FRE CNRS 2661University of Franche-ComtéBesançon cedexFrance

Personalised recommendations