Formal Aspects of Computing

, Volume 10, Issue 5–6, pp 436–451 | Cite as

Testing Algebraic Data Types and Processes: A Unifying Theory

  • Marie-Claude Gaudel
  • Perry R. James
Original Paper


There is now a lot of interest in program testing based on formal specifications. However, most the works in this area focus on one formalized aspect of the software under test. For instance, some previous works of the first author consider abstract data type specifications. Other works are based on behavioural descriptions, such as finite state machines or finite labelled transition systems. This paper begins by brie y recalling the principles of test data selection from algebraic data types specifications. Then, it transposes them to basic and full LOTOS. Finally it exploits this uniform framework and suggests a new integrated approach to test derivation from full LOTOS specifications, where both behavioural properties and data types properties are taken into account when dealing with processes.

Keywords: Black box testing; Formal testing; Full LOTOS 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 1998

Authors and Affiliations

  • Marie-Claude Gaudel
    • 1
  • Perry R. James
    • 2
  1. 1.Lab. de Recherche en Informatique, Université de Paris-Sud and CNRS, Orsay, FranceFR
  2. 2.Dep. de Ciência da Computação, IME-Universidade de São Paulo, São Paulo, BrazilBR

Personalised recommendations