This paper presents a formal approach for managing unanticipated software evolution. Labelled typed nested graphs are used to represent arbitrarily complex software artifacts, and conditional graph rewriting is used for managing evolution of these artifacts. More specifically, we detect structural and behavioural inconsistencies when merging parallel evolutions of the same software artifact. The approach is domain-independent, in the sense that it can be customised to many different domains, such as software architectures, UML analysis and design models, and software code.
CITATION STYLE
Mens, T. (2000). Conditional graph rewriting as a Domain-Independent formalism for software evolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1779, pp. 127–143). Springer Verlag. https://doi.org/10.1007/3-540-45104-8_10
Mendeley helps you to discover research relevant for your work.