A Systematic Literature Review of Test Breakage Prevention and Repair Techniques <s> Heuristic-based approach <s> Graphical user interfaces (GUIs) make up a large portion of the code comprising many modern software applications. However, GUI testing differs significantly from testing of traditional software. One respect in which this is true is test case maintenance. Due to the way that GUI test cases are often implemented, relatively minor changes to the construction of the GUI can cause a large number of test case executions to malfunction, often because GUI elements referred to by the test cases have been renamed, moved, or otherwise altered. We posit that a general solution to the problem of GUI test case maintenance must be based on heuristics that attempt to match an application’s GUI elements across versions. We demonstrate the use of some heuristics with framework support. Our tool support is general in that it may be used with other heuristics if needed in the future. <s> BIB001 </s> A Systematic Literature Review of Test Breakage Prevention and Repair Techniques <s> Heuristic-based approach <s> Test scripts used for web testing rely on DOM locators, often expressed as XPaths, to identify the active web page elements and the web page data to be used in assertions. When the web application evolves, the major cost incurred for the evolution of the test scripts is due to broken locators, which fail to locate the target element in the new version of the software. We formulate the problem of automatically generating robust XPath locators as a graph exploration problem, for which we provide an optimal, greedy algorithm. Since such an algorithm has exponential time and space complexity, we present also a genetic algorithm. <s> BIB002
+ Can be used with any other repair techniques BIB001 . -May not provide accurate and generalize solution BIB002 . -It needs practitioner's experience and knowledge to apply heuristics efficiently  .