Article (Scientific journals)
Conditional Graph Rewriting as a Domain-Independent Formalism for Software Evolution
Mens, Tom
2000In Lecture Notes in Computer Science, 1779, p. 127-143
Peer reviewed
 

Files


Full Text
agtivefinal1999-11-26.pdf
Publisher postprint (83.2 kB)
Request a copy

All documents in ORBi UMONS are protected by a user license.

Send to



Details



Abstract :
[en] 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.
Disciplines :
Computer science
Electrical & electronics engineering
Author, co-author :
Language :
English
Title :
Conditional Graph Rewriting as a Domain-Independent Formalism for Software Evolution
Publication date :
01 January 2000
Journal title :
Lecture Notes in Computer Science
ISSN :
0302-9743
eISSN :
1611-3349
Publisher :
Springer, Heidelberg, Germany
Volume :
1779
Pages :
127-143
Peer reviewed :
Peer reviewed
Available on ORBi UMONS :
since 17 December 2012

Statistics


Number of views
0 (0 by UMONS)
Number of downloads
0 (0 by UMONS)

OpenCitations
 
7

Bibliography


Similar publications



Contact ORBi UMONS