Test data selection from algebraic specifications: Application to an automatic subway module

  • Pierre Dauchy
  • Bruno Marre
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 550)


A method and a tool for black-box program testing are applied to a realistic example, a part of an automatic subway driving system. Test data sets are automatically selected from an algebraic specification of the system via selection strategies derived from well-chosen hypotheses. This selection is done in a modular way and can be tuned by the user of the system.

Key Words

software testing algebraic specifications program correctness transportation systems software reliability 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ADJ 76]
    J. Goguen, J. Thatcher, E. Wagner “An initial algebra approach to the specification, correctness, and implementation of abstract data types” Current Trends in Programming Methodology, Vol.4, Yeh Ed., Prentice Hall (1978) Google Scholar
  2. [BD 77]
    R. Burstall, J. Darlington “A transformation system for developing recursive programs” J. Assoc. Comput. Mach., 1 (1977) Google Scholar
  3. [Ber 90]
    G. Bernot “Testing against formal specifications: a theoretical view” TAPSOFT 91, Brighton (April 91) Google Scholar
  4. [BGM 91]
    G. Bernot, M.-C. Gaudel, B. Marre “Software testing based on formal specifications: a theory and a tool” Software Engineering Journal, to appear in November 1991 Also: LRI internal report nℴ581 (June 1990) Google Scholar
  5. [Cho 86]
    N. Choquet “Test data generation using a PROLOG with constraints” Workshop on Software Testing, Banff, Canada, IEEE Catalog Number 86TH0144-6, pp. 132–141 (July 1986) Google Scholar
  6. [Dau 89]
    P. Dauchy “Application de la méthode PLUSS de spécification formelle à une fonction du métro de Lyon” Journée AFCET-INRETS “Conception et Validation des Logiciels de Sécurité dans les Transports Terrestres”, Lille (June 1989) Google Scholar
  7. [EM 85]
    H. Ehrig, B. Mahr “Fundamentals of Algebraic Specification” EATCS Monographs on Theoretical Computer Science 6, Springer-Verlag (1985) Google Scholar
  8. [Fri 85]
    L. Fribourg “SLOG, a logic programming language interpreter based on clausal superposition and rewriting” International Symposium on Logic Programming, Boston (July 1985) Google Scholar
  9. [Gui 89]
    M.-C. Guillaumin “Spécification de l'UGE sécuritaire (édition 8)” Internal MAGGALY document, September 1988 Google Scholar
  10. [Hus 85]
    H. Hussmann “Unification in Conditional-Equational Theories” Technical Report MIP-8502, U. Passau (January 1985) Résum. Proc. EUROCAL 85 Conf., Linz.Google Scholar
  11. [Kot 80]
    L. Kott “Des substitutions dans les systèmes d'équations algébriques sur le magma, application aux transformations de programmes et à leur correction” Thèse d'Etat, Université Paris 7 (June 1980) Google Scholar
  12. [Nai 82]
    L. Naish “An introduction to MPU-PROLOG” Technical report, 82/2, Dept. of Computer Science, U. of Melbourne (1982) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Pierre Dauchy
    • 1
  • Bruno Marre
    • 1
  1. 1.Laboratoire de Recherche en Informatique, U.A. CNRS 410Université PARIS-SUDOrsay Cedex

Personalised recommendations