G. Rothermel and M. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Int'l. Symp. Softw. Testing Anal., Aug. 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the size of the execution history which is, in fact, the absolute upper bound of our algorithm) Keywords Software maintenence, reverse engineering, dynamic slicing 1. Introduction Program slicing methods are widely used for maintenance, reverse engineering, testing and debugging (e.g. 6] [12]) A slice 1 consists of all statements and predicates that might affect the variables in a set # at a program point # [15] 8] A slice may be an executable program or a subset of the program code. In the first case the behaviour of the reduced program with respect to a variable # and program ....

G. Rothermer and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of ISSTA'94, pages 169--183, Seattle, Washington, Aug. 1994.

....dynamic slices nor on the size of the execution history, hence it can be applied for real size applications. Keywords Dynamic slicing, relevant slicing, debugging 1 INTRODUCTION Program slicing methods are widely used for debugging, testing, reverse engineering and maintenance (e.g. 7] [16], 5] 8] A slice consists of all statements and predicates that might affect the variables in a set V at a program point p [18] A slice may be an executable program or a subset of the program code. In the first case the behaviour of the reduced program wrt a variable v and program point p is ....

Rothermer, G., and Harrold, M. J. Selecting tests and identifying test coverage requirements for modified software. In Proc. ISSTA'94 Seattle. 1994, 169183

....statically available information, i.e. can be computed at compile time are called static slicing. Slicing techniques could be applied to the engineering of programs in areas such as: algorithmic debugging [Kam93] FGK91] PGH94] differencing and integration [Hor92] regression testing [BaH93] [RgH94], reverse engineering [BeE93] and maintenance [GaL91] This paper is concerned with the problem of interprocedural static slicing. In [HRB90] the concept of system dependence graph (SDG) was introduced to construct the control flow and data flow representations of programs. The most ....

Rothermer G. and Harrold M.J.: Selecting tests and identifying test coverage requirements for modified software in:Proc. ISSTA'94 Seattle. 1994, 169--183

....corresponding vertices from certified. Tests from T that tested them in certified will continue to test them in modified (through the original call site) Pi 2.2.2 Limited Use Techniques The final two dependence graphs techniques make limited use of program slicing. First, Rothermel and Harrold [20] present algorithms that select tests for affected du pairs, and that determine those du pairs that may produce different behavior. Both intraprocedural and interprocedural versions are presented. The algorithms operate over the SDGs for certified and modified. The algorithms are safe in that ....

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 169--84, August 1994.

No context found.

G. Rothermel and M. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Int'l. Symp. Softw. Testing Anal., Aug. 1994.

No context found.

G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994.

No context found.

G. Rothermel and M. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Int'l. Symp. Softw. Testing Anal., Aug. 1994.

No context found.

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Int'l. Symp. Softw. Testing Anal., August 1994.

.... including test environments and automation [6, 9, 22, 61] capture playback mechanisms [34] test suite management [16, 21, 34, 51, 59] program size reduction [4] and regression testability [30] Most recent research on regression testing, however, concerns selective retest techniques (e.g. [1, 3, 5, 8, 14, 15, 20, 21, 25, 26, 27, 32, 36, 43, 45, 49, 51, 54, 55, 58, 60]) 4 Selective retest techniques reduce the cost of regression testing by reusing existing test cases, and identifying portions of the modified program or its specification that should be tested. Selective retest techniques differ from the retest all technique, which runs all test cases in the ....

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA 94), pages 169--184, August 1994.

.... including test environments and automation [6, 9, 22, 60] capture playback mechanisms [34] test suite management [16, 21, 34, 51, 58] program size reduction [5] and regression testability [30] Most recent research on regression testing, however, concerns selective retest techniques (e.g. [1, 3, 4, 8, 13, 15, 20, 21, 32, 36, 43, 45, 49, 51, 54, 55, 57, 59]) 3 Selective retest techniques reduce the cost of regression testing by reusing existing tests, and identifying portions of the modi ed program or its speci cation that should be tested. Selective retest techniques di er from the retest all technique, which runs all tests in the existing test ....

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modied software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA 94), August 1994.

....to gain confidence that it is correct. To reduce the cost of regression testing, we prefer to reuse tests from existing test suites where possible. Selective retest algorithms select, from existing test suites, tests that should be rerun on a modified program. We use a selective retest algorithm [20, 21] that uses control and data dependence information about a program P and a modified version, P 0 , to select all tests in the test suite for P that may produce different output in P 0 , and hence expose errors in P 0 . We are implementing our selective retest algorithm as an Aristotle tool, ....

G. Rothermel and M. J. Harrold, "Selecting tests and identifying test coverage requirements for modified software," Proceedings of the International Symposium on Software Testing and Analysis 94, August 1994, pp. 169-184.

....Research on regression testing spans a wide variety of topics. Test environments and automation (e.g. 13] and capture playback mechanisms (e.g. 17] provide support for regression testing. Techniques for regression test selection (e.g. 1, 4, 12, 30] coverage identification (e.g. [12, 19, 28]) and test suite maintenance (e.g. 9, 27, 34, 35] facilitate selective testing of the modified software. Regression testability permits estimation, prior to regression test selection, of the number of tests that will be selected by a method (e.g. 10, 15, 24] or evaluation, prior to ....

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis, pages 169--184, August 1994.

....and the IPDG for RemDups2, with changes enclosed in dotted rectangles. other pair of regions enclosing code that has been changed. In either case, such tests may produce different output in P 0 than in P . For more detailed discussion of the algorithm used by SelectApplTests, see [22] and [23]. The following examples demonstrate the use of the algorithm. Suppose the search method is modified, yielding search2 as shown in Figure 4. In search2, line P34 has been (erroneously) modified, and a new line, S35a, has been added. Also, a new state variable, mostrecentlyfound, and a new ....

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA 94), August 1994.

....KEY WORDS: program analysis, software engineering, CASE, experimental systems INTRODUCTION Many techniques for automating software engineering tasks rely on program analysis information information that is obtained by analyzing software. For example, several regression testing techniques [1, 4, 5, 9, 22, 23] use control and data dependence information to determine the retesting required after a program is modified. Techniques such as data flow testing [8, 14, 18, 20] test case generation [13] and dynamic execution profiling [3] require control flow information. Tools for program understanding and ....

G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis, pages 169--184, August 1994.

....behaves correctly and that modifications have not adversely impacted the software s quality. Regression testing is expensive; it can account for as much as one half of the cost of software maintenance [5, 21] Although a considerable amount of research on regression testing has been done(e.g. [2, 6, 10, 12, 19, 22, 20]) little of this research has been transferred into practice. One reason for this inadequacy is that experimentation on software regression testing, which requires software, versions, test inputs and documentation, is especially difficult. The contributions of this work are twofold. First, we ....

G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proc. of the ACM Int'l. Symp. on Softw. Testing and Analysis, pages 169--184, Aug. 1994.

....dependence or data dependence information. Some techniques use control or data dependence information to select test data and determine test set adequacy [31] to extend data flow testing techniques [12] or to generate reduced test sets for programs [15] Several techniques for regression testing [3, 7, 8, 16, 37, 38] use control or data dependence information to determine the retesting required after changes are made to a program. Additionally, techniques that integrate different versions of programs [28] require control and data dependence information. Finally, both static and dynamic slicing techniques ....

G. Rothermel and M.J. Harrold, "Selecting tests and identifying test coverage requirements for modified software", Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA 94), pp. 169--184, August 1994.

....the presentation. 4 In this context, the problem of interactive, incremental testing of form based programs resembles the problem of regression testing imperative programs, and we could adapt techniques for incremental dataflow analysis (e.g. 15, 20] and incremental dataflow testing (e.g. [11, 12, 22] of imperative programs to generalize this approach. This generalized approach applies to programs in which cell references are recursive or in which formulas contain iteration or redefinitions of variables. For most form based languages, however, the simpler approach that we present here ....

G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proc. 1994 Intl. Symp. Softw. Testing and Analysis, pages 169--184, Aug. 1994.

.... including test environments and automation [10, 12, 24, 25, 58] capture playback mechanisms [33] test suite management [16, 23, 33, 51, 56] program size reduction [7] and regression testability [29] Most recent research on regression testing, however, concerns selective retest techniques [1, 4, 6, 8, 11, 13, 14, 15, 18, 19, 20, 21, 22, 23, 27, 28, 30, 31, 39, 41, 43, 44, 45, 49, 50, 51, 52, 54, 55, 57]. Selective retest techniques reduce the cost of regression testing by reusing existing tests, and identifying portions of the modified program or its specification that should be tested. Selective retest techniques differ from the retest all technique, which runs all tests in the existing test ....

....4. 1 Analytical Evaluation and Comparison Although some regression test selection techniques select tests based on information collected from program specifications [31, 52] most techniques, including ours, select tests based on information about the code of the program and the modified version [1, 4, 6, 8, 11, 13, 14, 15, 18, 23, 27, 28, 31, 39, 43, 45, 50, 51, 54, 57]. These code based techniques pursue various goals. Coverage techniques emphasize the use of structural coverage criteria; they attempt to locate program components, such as statements or definition use pairs, that have been modified or may be affected by modifications, and select tests from T ....

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA 94). ACM Press, August 1994.

....the presentation. 6 In this context, the problem of interactive, incremental testing of form based programs resembles the problem of regression testing imperative programs, and we could adapt techniques for incremental dataflow analysis (e.g. 15, 20] and incremental dataflow testing (e.g. [11, 12, 22]) of imperative programs to generalize this approach. This generalized approach applies to programs in which cell references are recursive or in which formulas contain iteration. For most form based languages, however, the simpler approach that we present here suffices. 1. algorithm UnValidate(C) ....

G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proc. 1994 Intl. Symp. Softw. Testing and Analysis, pages 169--184, Aug. 1994.

....by selecting some subset of the existing test suite. 2 Although some regression test selection techniques select tests based on information collected from program specifications[28, 40] most techniques select tests based on information about the code of the program and the modified version[1, 2, 3, 5, 7, 10, 11, 13, 15, 16, 17, 18, 20, 19, 24, 25, 27, 28, 31, 33, 35, 34, 37, 38, 39, 41, 42, 45]. These code based techniques pursue three distinct goals. Coverage techniques locate program components that have been modified or affected by modifications, and select tests in T that exercise those components. Minimization techniques work like coverage techniques, but select minimal sets of ....

....of slicing techniques. the use of coverage requirements. The techniques require collection of test trace information at either the statement or procedure level; some of the techniques also require tools for static and dynamic dependence analysis. 5. 11 Graph Walk Techniques Rothermel and Harrold[32, 33, 35] present an intraprocedural regression test selection technique that builds control flow graphs (CFGs) for P and P 0 , collects traces for tests in T that associate tests with CFG edges, and performs synchronous depth first traversals of the two graphs, comparing nodes (or actually, the ....

[Article contains additional citation context not shown here]

G. Rothermel and M.J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA 94), pages 169-- 184, August 1994.

.... regression testing techniques identify these indirectly affected def use associations by either running all tests from the test suite that previously executed through the changed code[9, 10, 19] or using slicing techniques that require prior computation of the data flow information for the program[2, 18]. This paper presents a new approach to selective regression testing using the concept of a program slice.A backward program slice [11, 20] at a program point p for variable v consists of all statements in the program, including conditionals, that might affect the value of v at p,whereas a ....

....graph requires the exhaustive recomputation of all def use associations in the program or the incremental update of changed def use associations based on previous def use associations. Adifferent approach to regression testing, also based on slicing, was developed by Rothermel and Harrold [17, 18]. This approach also uses a program dependence graph representation to identify the changed def use pairs for regression testing. Unlike the above approaches to slicing, the approach presented in this paper only requires partial data flow analysis following program changes and does not depend on ....

G. Rothermel and M.J. Harrold, "Selecting tests and identifying test coverage requirements for modified software, " Proceedings of the International Symposium on SoftwareTesting and Analysis,pp. 169-184, August 1994.

No context found.

G. Rothermel and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of ISSTA'94, pages 169--183, Seattle, Washington, Aug. 1994.

No context found.

G. Rothermer and M. J. Harrold. Selecting tests and identifying test coverage requirements for modified software. In Proceedings of ISSTA'94, pages 169--183, Seattle, Washington, Aug. 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC