Erratum: Leveraging Flexible Tree Matching to Repair Broken Locators in Web Automation Scripts
Sacha Brisset, Romain Rouvoy, Lionel Seinturier, Renaud Pawlak

TL;DR
This paper introduces Erratum, a novel tree matching-based method for repairing broken web element locators in automation scripts, significantly improving accuracy and scalability over existing approaches.
Contribution
Erratum is a new holistic locator repair technique leveraging tree matching algorithms to enhance accuracy and scalability in web automation script maintenance.
Findings
Erratum outperforms WATER by 67% in accuracy.
The approach scales better on complex web pages.
Empirical tests on large benchmark show improved robustness.
Abstract
Web applications are constantly evolving to integrate new features and fix reported bugs. Even an imperceptible change can sometimes entail significant modifications of the Document Object Model (DOM), which is the underlying model used by browsers to render all the elements included in a web application. Scripts that interact with web applications (e.g. web test scripts, crawlers, or robotic process automation) rely on this continuously evolving DOM which means they are often particularly fragile. More precisely, the major cause of breakages observed in automation scripts are element locators, which are identifiers used by automation scripts to navigate across the DOM. When the DOM evolves, these identifiers tend to break, thus causing the related scripts to no longer locate the intended target elements. For this reason, several contributions explored the idea of automatically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWeb Application Security Vulnerabilities · Web Data Mining and Analysis · Software Testing and Debugging Techniques
