| T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. Springer-Verlag, 2002. |
No context found.
T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. Springer-Verlag, 2002.
No context found.
Tom Mens, Serge Demeyer, and Dirk Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. Springer-Verlag, 2002.
No context found.
Mens, T., S. Demeyer and D. Janssens, Formalising behaviour preserving program transformations, in: Graph Transformation, Lecture Notes in Computer Science 2505 (2002), pp. 286--301.
No context found.
T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. SpringerVerlag, 2002.
No context found.
T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. Springer-Verlag, 2002.
No context found.
T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. Springer-Verlag, 2002.
....of fully automated tools [6] 2.4.2 Degree of formality A change support mechanism can either be implemented in an ad hoc way, or based on some underlying mathematical formalism. For example, the formalism of graph rewriting has been used to deal with change propagation [37] and refactoring [30]. In the context of re engineering, 48] is an example of a fully automated restructuring approach that is based on graph theory. It is clear that the degree of formality is orthogonal to the degree of automation. 2.4.3 Process support Process support is the extent to which activities in the ....
....type of change is clearly orthogonal to the previous dimensions. First, some semantics preserving changes can be fully automated [48, 32] while semantics modifying changes typically require a lot of manual intervention. Second, semantics preserving changes can be supported by a formal foundation [30] or not. Third, semantics preserving changes can be a crucial part in the change process, as in the case of extreme programming [3] 3 Dimensions as Characterizing and Influencing Factors An alternative view of the taxonomy is presented in Table 1. This table defines, for each dimension of the ....
[Article contains additional citation context not shown here]
T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In Graph Transformation, volume 2505 of Lecture Notes in Computer Science, pages 286--301. SpringerVerlag, 2002.
No context found.
Mens, T., Demeyer, S., Janssens, D.: Formalising behaviour preserving program transformations. In: Graph Transformation. Volume 2505 of Lecture Notes in Computer Science., Springer-Verlag (2002) 286--301
No context found.
Mens, T., S. Demeyer and D. Janssens, Formalising behaviour preserving program transformations, in: Proc. ICGT 2002 (2002), to appear.
No context found.
T. Mens, S. Demeyer, and D. Janssens. Formalising behaviour preserving program transformations. In A. Corradini, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, Proc. Graph Transformation - First International Conference, ICGT 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC