Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch this 15-minute conference presentation from OOPSLA 2025 that introduces a novel approach to automatically synthesizing program references in modern programming languages. Learn how researchers from Delft University of Technology and TNO-ESI address the challenge of implementing sound automated refactorings in Integrated Development Environments (IDEs) without introducing name-binding errors. Discover the concept of "locked references" as a solution to separate binding preservation from transformation, and explore how the team automatically derives inverse lookup functions from type system specifications written in the Statix meta-DSL. Understand how scope graphs represent program binding structures to guide the synthesis of qualified references and infer their names and syntactic structures. Examine the evaluation results demonstrating the approach's effectiveness across 2,528 Java programs, 196 ChocoPy programs, and 49 Featherweight Generic Java test programs. Gain insights into this language-parametric method that provides a principled solution for reference synthesis, addressing the complex name-binding features present in modern programming languages and offering a systematic approach to maintaining code correctness during automated refactoring operations.
