Test case characterisation by regular path expressions

Authors

Ralf Lämmel and Jörg Harm

Abstract

A signature-parametric (say generic) framework for test case characterisation, and definition of test set coverage criteria is developed. The signature might correspond to a programming language syntax, the format of a data structure, a computational or semantical structure, e.g., for derivations, proof trees, or control-flow graphs. Test set characterisation is based on regular expressions describing paths for terms over the signature at hand. Necessary and convenient properties for test set coverage criteria can be conceived in the framework. The framework is simple in the sense that it is solely based on term algebras and basic regular language theory. The specifications in the framework can be effectively used for coverage analysis, and for test case and test set generation.

Bibtex entry

@InProceedings{LH01-FATES,
 author = "Ralf L{\"a}mmel and J{\"o}rg Harm",
 title = "{Test case characterisation by regular path expressions}",
 booktitle = "{Proc.\ Formal Approaches to Testing of Software (FATES'01)}",
 year = 2001,
 month = august,
 editor = {Ed Brinksma and Jan Tretmans},
 series = "Notes Series NS-01-4",
 publisher = "BRICS",
 pages = "109--124"
}

Download

• Paper: Postscript, PDF
• Slides: Postscript, PDF