Formalizing Software Refactoring in the Distributed Environment by aedNLC Graph Grammar
暂无分享,去创建一个
[1] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.
[2] L. Kotulski,et al. Parallel allocation of the distributed software using node label controlled graph grammars , 2008 .
[3] Anneke Kleppe,et al. The object constraint language: precise modeling with UML , 1998 .
[4] Leszek Kotulski. Graph Representation of the Nested Software Structure , 2005, International Conference on Computational Science.
[5] Leszek Kotulski,et al. Graph Repository as a Core of Environment for Distributed Software Restructuring and Refactoring , 2006, IASTED Conf. on Software Engineering.
[6] Tom Mens,et al. Detecting Structural Refactoring Conflicts Using Critical Pair Analysis , 2005, SETra@ICGT.
[7] Ralph E. Johnson,et al. A Refactoring Tool for Smalltalk , 1997, Theory Pract. Object Syst..
[8] Leszek Kotulski,et al. On the Use of Graph Grammers for the Control of a Distributed Software Allocation , 1992, Comput. J..
[9] Don Roberts,et al. Practical analysis for refactoring , 1999 .
[10] Mariusz Flasinski. Power Properties of NLC Graph Grammars with a Polynomial Membership Problem , 1998, Theor. Comput. Sci..
[11] Tom Mens,et al. A State-of-the-Art Survey on Software Merging , 2002, IEEE Trans. Software Eng..
[12] Gregor Engels,et al. Encapsulated hierarchical graphs, graph types, and meta types , 1995, SEGRAGRA.