- Authors:
- DOI:
- 10.1145/2509136.2509520
- Abstract:
- Modern IDEs support automated refactoring for many programming languages, but support for JavaScript is still primitive. To perform renaming, which is one of the fundamental refactorings, there is often no practical alternative to simple syntactic search-and-replace. Although more sophisticated alternatives have been developed, they are limited by whole-program assumptions and poor scalability. We propose a technique for semi-automatic refactoring for JavaScript, with a focus on renaming. Unlike traditional refactoring algorithms, semi-automatic refactoring works by a combination of static analysis and interaction with the programmer. With this pragmatic approach, we can provide scalable and effective refactoring support for real-world code, including libraries and incomplete applications. Through a series of experiments that estimate how much manual effort our technique demands from the programmer, we show that our approach is a useful improvement compared to search-and-replace tools.
- Type:
- Conference paper
- Language:
- English
- Published in:
- Acm Sigplan International Conference on Object-oriented Programming, Systems, Languages and Applications, 2013, p. 323-338
- Main Research Area:
- Science/technology
- Publication Status:
- Published
- Review type:
- Peer Review
- Conference:
- ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA), 2013
- Submission year:
- 2013
- Scientific Level:
- Scientific
- ID:
- 254654479
Checking for on-site access...
