Abstract
Refactoring has to preserve the dynamics of the transformed program with respect to a particular definition of semantics and behavioral equivalence. Apparently, it is always challenging to relate executable refactoring implementations with the formal semantics of the transformed language. There are a number of approaches to specifying program transformations on various kinds of program models, but trustworthiness of refactoring is still to be improved by means of formal verification. We propose a specification formalism and a generic framework for its processing, which claims to allow semi-automatic execution and formal verification, as well as to be adaptable to multiple paradigms.
Subject
Computer Vision and Pattern Recognition,Software,Computer Science (miscellaneous),Electrical and Electronic Engineering,Information Systems and Management,Management Science and Operations Research,Theoretical Computer Science
Reference29 articles.
1. K-Java
2. RefactorErl - Source Code Analysis and Refactoring in Erlang;Bozo,2011
3. Program Transformation with Scoped Dynamic Rewrite Rules;Bravenboer;Fundam. Inf.,2005
4. Cesarini, Francesco and Thompson, Simon. ERLANG Programming. O’Reilly Media, Inc., 1st edition, 2009. ISBN: 0-596-51818-8.
5. A language-independent proof system for full program equivalence
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献