Paper Info
Title
Refactoring With Ordered Collections Of Fine-Grain Transformations
Abstract
The objective of this paper is to explain the notion of fine-grain transformations (FGTs), showing how they can be used as prototypical building blocks for constructing refactorings of a design-level system description. FGT semantics are specified in terms of pre- and postconditions which, in turn, also determines the sequential dependency relationships between them. An algorithm is provided which uses sequential dependency relationships to convert an FGT-list to a set of so-called FGT-DAGs. It is shown how to compute the precondition of such ordered collections of FGTs. The paper introduces a new approach to deal with refactoring pre-and postconditions by defining them at two different levels. To give these concepts syntactical form, we rely on the Prolog formats used by an FGT-based refactoring prototype tool. An example is provided to illustrate the various concepts and to demonstrate that, because of their simplicity, well-defined pre-post semantics and their intuitive nature, FGTs provide a pragmatic basis for building refactorings.
Year
DOI
Venue
2013
10.1142/S0218194013500095
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING
Keywords
Field
DocType
Refactoring, FGT-based refactoring, fine-grain transformations, refactoring-level precondition, FGT-enabling precondition, directed acyclic graph
Programming language,Computer science,Directed acyclic graph,Precondition,Theoretical computer science,Prolog,Code refactoring,Semantics
Journal
Volume
Issue
ISSN
23
3
0218-1940
Citations 
PageRank 
References 
0
0.34
9
Authors
2
Name
Order
Citations
PageRank
Emmad Saadeh111.04
Derrick G. Kourie222333.10