Premium
Inclusion, subsumption, JJ‐paths, and structured path testing: a Redress
Author(s) -
Yates D. F.,
Malevris N.
Publication year - 2009
Publication title -
software testing, verification and reliability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 49
eISSN - 1099-1689
pISSN - 0960-0833
DOI - 10.1002/stvr.400
Subject(s) - path (computing) , relation (database) , jump , inclusion (mineral) , context (archaeology) , code (set theory) , computer science , redress , statement (logic) , algorithm , theoretical computer science , mathematics , programming language , data mining , law , epistemology , psychology , history , social psychology , philosophy , physics , archaeology , set (abstract data type) , quantum mechanics , political science
Introduced in 1976 by Hennell, Woodward, and Hedley, the Linear Code Sequence and Jump (LCSAJ) has since been named the jump‐to‐jump path (JJ‐path). If all JJ‐paths in a piece of code have been tested, then it is guaranteed, for example, that all of the code's branches and all of its statements will likewise have been tested. JJ‐path testing is thus said to include both branch and statement testing. Over the years, much work has been carried out on the inclusion relation, and this is also true of a closely‐linked relation that is known as subsumption. Not surprisingly, some of the work in the literature has focussed on the criteria of executing all JJ‐paths and sequences of such, and how these criteria relate to other path coverage and test data criteria. Unfortunately, certain results involving JJ‐paths in the context of inclusion, as portrayed in a widely referenced and influential paper, are in error. Consequently, the main purpose of this paper is to rectify this situation. Copyright © 2008 John Wiley & Sons, Ltd.