Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theoretic developments as usual definitions of test data adequacy criteria ignore infinite paths. This paper develops a theory of program-based structural testing based on operational semantics. Reasoning at the program semantics level permits to cope with infinite paths (and non-feasible paths) when defining test data adequacy criteria. As a result, our criteria respect the first Weyuker’s property on finite applicability, even for non-terminating programs. We discuss the consequences of this re-interpretation of test data adequacy criteria w.r.t. existing test coverage criteria.
|Titel||33rd Annual IEEE International Computer Software and Applications Conference|
|Status||Udgivet - 2009|
|Begivenhed||33rd IEEE International Computer Software and Applications Conference - Seattle, USA|
Varighed: 20 jul. 2009 → 24 jul. 2009
Konferencens nummer: 33
|Konference||33rd IEEE International Computer Software and Applications Conference|
|Periode||20/07/2009 → 24/07/2009|