Refactoring-based support for binary compatibility in evolving frameworks
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Scheduling of conflicting refactorings to promote quality improvement
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Systematically refactoring inheritance to delegation in java
Proceedings of the 30th international conference on Software engineering
Fine-grain transformations to refactor UML models
Proceedings of the Warm Up Workshop for ACM/IEEE ICSE 2010
Generating Rewritable Abstract Syntax Trees
Software Language Engineering
ICSR '09 Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering
Safe composition of non-monotonic features
GPCE '09 Proceedings of the eighth international conference on Generative programming and component engineering
Composite refactoring using fine-grained transformations
Proceedings of the 2009 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Applying a Model Transformation Taxonomy to Graph Transformation Technology
Electronic Notes in Theoretical Computer Science (ENTCS)
A graphical approach to prove the semantic preservation of UML/OCL refactoring rules
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Refactoring object-oriented specifications with data and processes
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Towards an appropriate software refactoring tool support
ACS'09 Proceedings of the 9th WSEAS international conference on Applied computer science
Refactoring pipe-like mashups for end-user programmers
Proceedings of the 33rd International Conference on Software Engineering
Iterative development of consistency-preserving rule-based refactorings
ICMT'11 Proceedings of the 4th international conference on Theory and practice of model transformations
A refactoring constraint language and its application to eiffel
Proceedings of the 25th European conference on Object-oriented programming
From graph transformation to software engineering and back
Formal Methods in Software and Systems Modeling
On the use of graph transformations for model refactoring
GTTSE'05 Proceedings of the 2005 international conference on Generative and Transformational Techniques in Software Engineering
E-CARES project: reengineering of telecommunication systems
GTTSE'05 Proceedings of the 2005 international conference on Generative and Transformational Techniques in Software Engineering
Refinement and consistency in component models with multiple views
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
Differential precondition checking: A lightweight, reusable analysis for refactoring tools
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Evaluating agent-oriented programs: towards multi-paradigm metrics
ProMAS'10 Proceedings of the 8th international conference on Programming Multi-Agent Systems
Architecture migration driven by code categorization
ECSA'07 Proceedings of the First European conference on Software Architecture
An Aspect Oriented Component Based Archetype Driven Development
Journal of Information Technology Research
| Hi-index | 0.00 |
The widespread interest in refactoring—transforming the source-code of an object-oriented program without changing its external behaviour—has increased the need for a precise definition of refactoring transformations and their properties. In this paper we explore the use of graph rewriting for specifying refactorings and their effect on programs. We introduce a graph representation for programs and show how two representative refactorings can be expressed by graph productions. Then we demonstrate that it is possible to prove that refactorings preserve certain program properties, and that graph rewriting is a suitable formalism for such proofs. Copyright © 2005 John Wiley & Sons, Ltd.