Towards a Theory for Testing Non-terminating Programs

Arnaud Gotlieb, Matthieu Petit

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-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.
Original languageEnglish
Title of host publication33rd Annual IEEE International Computer Software and Applications Conference
PublisherIEEE
Publication date2009
Pages160-165
Publication statusPublished - 2009
Event33rd IEEE International Computer Software and Applications Conference - Seattle, United States
Duration: 20 Jul 200924 Jul 2009
Conference number: 33

Conference

Conference33rd IEEE International Computer Software and Applications Conference
Number33
Country/TerritoryUnited States
CitySeattle
Period20/07/200924/07/2009

Keywords

  • Structural Software Testing
  • Test Data Adequacy Criteria

Cite this