G. Rothermel and M. Harrold, "A safe, efficient algorithm for regression test selection", Proceedings, IEEE Software Maintenance Conference, 1993, pp. 358--367.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....domain is critical for successful evolution. When a feature is implemented by a single function, evolution can be straightforward; a many to many relationship must be decomposed further for evolution. Many researchers have studied regression testing from a theoretical point of view [3] 14] 19][23][24] A testing organization accumulates regression test cases for a legacy system Figure 1: Evolution Methodology. Legacy system to be evolved Step 1 Map test cases to features Step 2a Map features to functionality Step Step Create fine grained component Step 2d: Integrate component into ....

G. Rothermel and M. Harrold, "A safe, efficient algorithm for regression test selection", Proceedings, IEEE Software Maintenance Conference, 1993, pp. 358--367.

.... to satisfy white box test criteria such as branch or dataflow coverage of the portions of the code that are considered directly or indirectly affected by the code changes (Ostrand and Weyuker, 1988; Harrold and Soffa, 1988; Agrawal et al. 1988; Rothermel and Harrold, 1994b; Kung et al. 1996; Rothermel and Harrold, 1993; Rothermel and Harrold, 1996; Binkley, 1997) Fewer researchers have been concerned with gray box and black box regression testing (von Mayrhauser et al. 1994a; Leung and White, 1990; Leung, 1995) Here, changes related to the functionality of a system are regression tested. With the advent of ....

....analyzed the fundamental issues involved in classifying test cases for regression testing. Control Flow Graph changes are used as example to classify existing test cases. Agrawal, Horgan, Kranser and London (Agrawal et al. 1988) use slices to select retestable test cases. Harrold and Rothermel (Rothermel and Harrold, 1993) formalize a safe and efficient algorithm for test case selection based on changes to the Control Dependency Graph. Harrold and Soffa (Harrold and Soffa, 1988) and Ostrand and Weyuker (Ostrand and Weyuker, 1988) analyze programs written in procedural languages based on Data Flow Graphs (DFG) and ....

[Article contains additional citation context not shown here]

Rothermel, G. and Harrold, M. J. (1993) `A safe, efficient algorithm for regression test selection', in Proceedings Conference on Software Maintenance--1993, IEEE Computer Society Press, Los Alamitos CA, pp. 358--367.

....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, "A safe, efficient algorithm for regression test selection," Proceedings of the Conference on Software Maintenance '93, September 1993, pp. 358-367.

....examples. Section 4.3 addresses interprocedural testing. 4.1 Motivating observations Our goal is to distinguish potentially revealing tests in a modified program from those that cannot exhibit altered behavior. Toward this goal we offer the following discussion (presented more formally in [17]) In order for a particular test T i , run originally on program P , to exhibit different behavior when run on program P 0 , the sequence of statements that T i traverses in P 0 must differ from the sequence it traversed in P . If test T i , run on P 0 , does not traverse any modified ....

.... tests known to execute statements nested under that region node) and we can keep test execution histories that list these regions (as in Figure 2) We now present the fundamental theorem on which our technique is based (for reasons of space, we omit the proof; interested readers are referred to [17]) THEOREM 1. Given the CDG (CDG) of program P , the CDG (CDG 0 ) of program P 0 , and test suite T in which test execution histories list the regions in P traversed by each test; the only tests in T that can traverse different sequences of statements in P 0 and P are those attached ....

G. Rothermel and M.J. Harrold, "A safe, efficient algorithm for regression test selection," Technical Report 115, Clemson University, Clemson, SC, April, 1993.

....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 "A safe, efficient algorithm for regression test selection," Proceedings of the Conference on Software Maintenance '93, pp. 358--367, September 1993.

....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, "A safe, efficient algorithm for regression test selection," Proceedings of the International Conference on Softwaremaintenance ,pp. 358-367, September 1993.

No context found.

G. Rothermel and M. Harrold. "A safe, efficient algorithm for regression test selection". Proceedings, IEEE Software Maintenance Conference, 1993, pp. 358--367.

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