Results 1  10
of
1,073
Congruences for Contextual GraphRewriting
, 2004
"... We introduce a comprehensive operational semantic theory of graphrewriting. Graphrewriting here is ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We introduce a comprehensive operational semantic theory of graphrewriting. Graphrewriting here is
Term Graph Rewriting
, 1998
"... Term graph rewriting is concerned with the representation of functional expressions as graphs, and the evaluation of these expressions by rulebased graph transformation. Representing expressions as graphs allows to share common subexpressions, improving the efficiency of term rewriting in space ..."
Abstract

Cited by 89 (5 self)
 Add to MetaCart
Term graph rewriting is concerned with the representation of functional expressions as graphs, and the evaluation of these expressions by rulebased graph transformation. Representing expressions as graphs allows to share common subexpressions, improving the efficiency of term rewriting in space
Computing with Graphs and Graph Rewriting
 FACHGRUPPE INFORMATIK, RWTH
, 1997
"... Graphs are a popular data structure. Programmers are faced with the need to represent, inspect, modify, display and recognize graphs. In this paper we describe a systematic approach to graph modification, using graph rewrite rules. Graph rewrite rules replace one subgraph by another subgraph. In ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Graphs are a popular data structure. Programmers are faced with the need to represent, inspect, modify, display and recognize graphs. In this paper we describe a systematic approach to graph modification, using graph rewrite rules. Graph rewrite rules replace one subgraph by another subgraph
Relational Graph Rewritings
 Theoretical Computer Science, Vol
, 1995
"... This note presents a new formalization of graph rewritings which generalizes traditional graph rewritings. Relational notions of graphs and their rewritings are introduced and several properties about graph rewritings are discussed using relational calculus (theory of binary relations). Single pusho ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This note presents a new formalization of graph rewritings which generalizes traditional graph rewritings. Relational notions of graphs and their rewritings are introduced and several properties about graph rewritings are discussed using relational calculus (theory of binary relations). Single
Admissible Graph Rewriting and Narrowing
 IN PROCEEDINGS OF THE JOINT INTERNATIONAL CONFERENCE AND SYMPOSIUM ON LOGIC PROGRAMMING
, 1998
"... We address the problem of graph rewriting and narrowing as the underlying operational semantics of rulebased programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first char ..."
Abstract

Cited by 35 (10 self)
 Add to MetaCart
We address the problem of graph rewriting and narrowing as the underlying operational semantics of rulebased programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructorbased graph rewriting systems. For this purpose, we first
Parallel admissible graph rewriting
 In Recent Trends in Algebraic Development Techniques
, 1999
"... Abstract. We investigate the rewrite relation over graphs induced by constructorbased weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that th ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. We investigate the rewrite relation over graphs induced by constructorbased weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however
Extending Graph Rewriting with Copying
 Graph Transformations in Computer Science, International Workshop, Dagstuhl
, 1994
"... . The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a confluence result is obtained for these socalled copy term graph rewrite systems (CTGRS). Some ideas on the use of lazy copying in practice are presented. 1 Introduction Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a confluence result is obtained for these socalled copy term graph rewrite systems (CTGRS). Some ideas on the use of lazy copying in practice are presented. 1 Introduction
Termination Of Graph Rewriting Is Undecidable
, 1998
"... It is shown that it is undecidable in general whether a graph rewriting system (in the "double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turin ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
It is shown that it is undecidable in general whether a graph rewriting system (in the "double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem
Aspect Weaving with Graph Rewriting
 In Proceedings of the First International Symposium on Generative and ComponentBased Software Engineering
, 2000
"... This paper introduces GRSbased AOP which explains a large subclass of AOP weavers as graph rewrite systems (GRS). The corresponding class of AOP problems has a formal background since it inherits all features of graph rewrite systems such as criteria for termination, confluence, and unique normal f ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper introduces GRSbased AOP which explains a large subclass of AOP weavers as graph rewrite systems (GRS). The corresponding class of AOP problems has a formal background since it inherits all features of graph rewrite systems such as criteria for termination, confluence, and unique normal
Constructs for Programming with Graph Rewrites
"... Abstract. Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The con ..."
Abstract
 Add to MetaCart
Abstract. Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language
Results 1  10
of
1,073