The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Potential Context Coverage
|
|
Author(s): Boris Cogan (London Metropolitan University, UK), Tamara Matveeva (London Metropolitan University, UK)and Nataliya Nikiforova (Russian Academy of Sciences, Russia)
Copyright: 2004
Pages: 4
Source title:
Innovations Through Information Technology
Source Editor(s): Mehdi Khosrow-Pour, D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-59140-261-9.ch126
ISBN13: 9781616921255
EISBN13: 9781466665347
|
Abstract
In this paper we present a new testing strategy that we are calling the potential context coverage for program units written in algorithmic programming languages (both ‘conventional’ and object-oriented ones: Pascal, Fortran, C, Java, etc.). We introduce the notion of context and potential context for algorithmic programming languages with the aid of a model for a program fragment, and define a testing strategy in support of our definition of potential context coverage. A comparison of this strategy with traditional ones showed that it covers all of them except all path coverage.
|
|