Skip to main content
Kent Academic Repository

Towards Trustworthy Refactoring in Erlang

Thompson, Simon, Horpacsi, Daniel, Koszegi, Judit (2016) Towards Trustworthy Refactoring in Erlang. In: Hamilton, Geoff and Lisitsa, Alexei and Nemytykh, Andrei P., eds. Electronic Proceedings in Theoretical Computer Science. Proceedings of the Fourth International Workshop on Verification and Program Transformation (VPT 2016). 216. pp. 83-103. (doi:10.4204/EPTCS.216.5) (KAR id:56750)


Tool-assisted refactoring transformations must be trustworthy if programmers are to be confident in applying them on arbitrarily extensive and complex code in order to improve style or efficiency. We propose a simple, high-level but rigorous, notation for defining refactoring transformations in Erlang, and show that this notation provides an extensible, verifiable and executable specification language for refactoring. To demonstrate the applicability of our approach, we show how to define and verify a number of example refactorings in the system.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.4204/EPTCS.216.5
Uncontrolled keywords: refactoring functional verification trustworthy domain-specific language
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.76 Computer software
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: S. Thompson
Date Deposited: 05 Aug 2016 11:14 UTC
Last Modified: 16 Feb 2021 13:36 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.