Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Trustworthy Refactoring in Erlang (1607.02228v1)

Published 8 Jul 2016 in cs.PL and cs.SE

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Dániel Horpácsi (10 papers)
  2. Judit Kőszegi (2 papers)
  3. Simon Thompson (18 papers)
Citations (9)

Summary

We haven't generated a summary for this paper yet.