Skip to search formSkip to main contentSkip to account menu

Graph rewriting

Known as: Graph grammar, Graph transformation 
In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Object-oriented analysis suggests semiformal use-case driven techniques for problem domain modeling from a computation… 
2008
2008
The object-oriented analysis suggests semiformal use-case driven techniques for problem domain modeling from a computation… 
2007
2007
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical… 
2005
2005
Models and model transformations are the core concepts of OMG’s MDATM approach. Within this approach, most models are derived… 
2002
2002
We are exploring the use of formal grammars to represent two distinct but interconnected attributes of mechanical designs… 
2002
2002
Tropos is an agent-oriented methodology that covers software development from early requirements analysis to detailed design… 
2000
2000
Commercial off-the-shelf repository management systems claim to provide a solid basis for building CASE tools by offering special… 
2000
2000
We combine the methodology of Plotkin-style operational semantics with graph transformation concepts in order to specify the… 
1997
1997
We address the problem of graph rewriting as the underlying operational semantics of rule-based programming languages. We deene a… 
1989
1989
We present a graph-based formal approach to revision control that takes consistency relations between revisions of different…