Renaud Pawlak
Papers
1
Total Citations
12
H-Index
1
About
Renaud Pawlak is a computer scientist whose research centers on software engineering, web automation, and program analysis. His most-cited work, "Leveraging Flexible Tree Matching to repair broken locators in web automation scripts" (2021), addresses a critical challenge in web testing: the fragility of locators used in automated scripts. By introducing flexible tree-matching techniques, Pawlak enables robust repair of broken locators, significantly improving the reliability and maintainability of web automation—a contribution with practical impact in software testing and DevOps. This paper has garnered 12 citations, reflecting its relevance to both academia and industry. Beyond this, Pawlak has explored program transformation and metaprogramming, contributing to tools that facilitate code analysis and refactoring. His work bridges theory and practice, offering solutions that reduce maintenance overhead in complex software systems. For students and researchers, Pawlak’s research exemplifies how algorithmic innovation can solve real-world engineering problems, making him a notable figure in the field of software maintenance and automation.
Research Focus
Key Achievements
Top Papers
- 1