Skip to main content
Log in

Testing Algebraic Data Types and Processes: A Unifying Theory

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received February 1998 / Accepted in revised form October 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gaudel, MC., James, P. Testing Algebraic Data Types and Processes: A Unifying Theory. Form Aspects Comput 10, 436–451 (1998). https://doi.org/10.1007/s001650050026

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650050026

Navigation