Towards a Theory for Testing Non-terminating Programs

Arnaud Gotlieb, Matthieu Petit

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Abstract

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.
OriginalsprogEngelsk
Titel33rd Annual IEEE International Computer Software and Applications Conference
ForlagIEEE
Publikationsdato2009
Sider160-165
StatusUdgivet - 2009
Begivenhed33rd IEEE International Computer Software and Applications Conference - Seattle, USA
Varighed: 20 jul. 200924 jul. 2009
Konferencens nummer: 33

Konference

Konference33rd IEEE International Computer Software and Applications Conference
Nummer33
LandUSA
BySeattle
Periode20/07/200924/07/2009

Citer dette

Gotlieb, A., & Petit, M. (2009). Towards a Theory for Testing Non-terminating Programs. I 33rd Annual IEEE International Computer Software and Applications Conference (s. 160-165). IEEE.