Test generation based on symbolic specifications

L. Frantzen, J. Tretmans, T.A.C. Willemse

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

74 Citations (Scopus)

Abstract

Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values. To implement these theories, data types which have infinite universes have to be cut down to finite variants, which are subsequently enumerated to fit in the model. This leads to an explosion of the state space. Moreover, exploiting the syntactical and/or semantical information of the involved data types is non-trivial after enumeration. To overcome these problems, we lift the family of testing relations ioco F to the level of Symbolic Transition Systems (STSs). We present an algorithm based on STSs, which generates and executes tests on-the-fly on a given system. It is sound and complete for the ioco F testing relations.
Original languageEnglish
Title of host publicationFormal Approaches to Software Testing (4th International Workshop, FATES 2004, Linz, Austria, September 21, 2004, Revised selected papers)
EditorsJ. Grabowski, B. Nielsen
Place of PublicationBerlin
PublisherSpringer
Pages1-15
ISBN (Print)3-540-25109-X
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
Volume3395
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Test generation based on symbolic specifications'. Together they form a unique fingerprint.

Cite this