Skip to main content
Article thumbnail
Location of Repository

ªOn the Limit of Control Flow Analysis for Regression Test Selection,º

By Thomas Ball

Abstract

Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will have the same behavior as an old version of the program run on t, but without running the new program on t. RTS analyses must confront a price/performance tradeoff: a more precise analysis might be able to eliminate more tests, but could take much longer to run. We focus on the application of control flow analysis and control flow coverage, relatively inexpensive analyses, to the RTS problem, considering how the precision of RTS algorithms can be affected by the type of coverage information collected. We define a strong optimality condition (edge-optimality) for RTS algorithms based on edge coverage that precisely captures when such an algorithm will report that re-testing is needed, when, in actuality, it is not. We reformulate Rothermel and Harrold’s RTS algorithm and present three new algorithms that improve on it, culminating in an edgeoptimal algorithm. Finally, we consider how path coverage can be used to improve the precision of RTS algorithms.

Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.373.2103
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.purdue.edu/homes... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.