Results 1  10
of
37,698
Equational term graph rewriting
 Fundamenta Informaticae
, 1996
"... and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ..."
Abstract

Cited by 79 (7 self)
 Add to MetaCart
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
LogBased Reduction by Rewriting
, 2012
"... Abstract—Software systems often produce logs which contain information about the execution of the systems. When an error occurs, the log file with the error is reported for subsequent analysis. The longer the log file, the harder to identify the cause of the observed error. This problem can be consi ..."
Abstract
 Add to MetaCart
. The prototype was empirically validated on a web shop application. Keywordslogging; fault localisation; log reduction; log rewriting; property mining; I.
REWRITING SYSTEMS OVER UNRANKED TREES
, 2006
"... Finite graphs constitute an important tool in various fields of computer science. In order to transfer the theory of finite graphs at least partially to infinite systems, a finite representation of infinite systems is needed. Rewriting systems form a practical model for the finite representation of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
rewriting formalism, we define a reduction to ranked (binary) trees via an encoding and also to standard ground tree rewriting, and we show that the generated classes of transition graphs coincide. For the second introduced rewriting formalism over unranked trees using subtree rewriting combined with flat
Unification, Rewriting, and Narrowing on Term Graphs
 Electronic notes in Theoretical Computer Science 1
, 1995
"... The concept of graph substitution recently introduced by the authors is applied to term graphs, yielding a uniform framework for unification, rewriting, and narrowing on term graphs. The notion of substitution allows definitions of these concepts that are close to the corresponding definitions in th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
in the term world. The rewriting model obtained in this way is equivalent to "collapsed tree rewriting" and hence is complete for equational deduction. For term graph narrowing, a completeness result is established which corresponds to Hullot's classical result for term narrowing. The general
Higherorder portgraph rewriting
"... The biologically inspired framework of portgraphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we add higherorder features to the original po ..."
Abstract
 Add to MetaCart
portgraph syntax, along with a generalised notion of graph morphism. We provide a matching algorithm which enables to implement higherorder portgraph rewriting in PORGY, thus one can visually study the dynamics of the systems modelled. We illustrate the expressive power of higherorder portgraphs
The graph rewriting calculus : confluence and expressiveness
 in &quot;9th Italian conference on Italian Conference on Theoretical Computer Science  ICTCS 2005
"... Abstract. Introduced at the end of the nineties, the Rewriting Calculus (ρcalculus, for short) is a simple calculus that uniformly integrates termrewriting and λcalculus. The ρgcalculus has been recently introduced as an extension of the ρcalculus, handling structures with cycles and sharing. Th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
calculus is confluent. The proof of this result is quite elaborated, due to the nontermination of the system and to the fact that we work on equivalence classes of terms. We also show that the ρgcalculus can be seen as a generalization of firstorder termgraph rewriting, in the sense that for any termgraph rewrite
Rewriting Systems
, 1999
"... reduction systems . . . . . . . . . . . . . . . . . . . . 11 1.6 Properties of arss . . . . . . . . . . . . . . . . . . . . . . . . . 13 2 Lambda calculus and combinatory logic 17 2.1 Lambda terms . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.2 The rewrite rules . . . . . . . . . . . . ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
reduction systems . . . . . . . . . . . . . . . . . . . . 11 1.6 Properties of arss . . . . . . . . . . . . . . . . . . . . . . . . . 13 2 Lambda calculus and combinatory logic 17 2.1 Lambda terms . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.2 The rewrite rules
Rewriting Systems
"... reduction systems . . . . . . . . . . . . . . . . . . . . 15 1.6 Properties of arss . . . . . . . . . . . . . . . . . . . . . . . . . 16 2 Lambda calculus and combinatory logic 21 2.1 Lambda terms . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.2 The rewrite rules . . . . . . . . . . . ..."
Abstract
 Add to MetaCart
reduction systems . . . . . . . . . . . . . . . . . . . . 15 1.6 Properties of arss . . . . . . . . . . . . . . . . . . . . . . . . . 16 2 Lambda calculus and combinatory logic 21 2.1 Lambda terms . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.2 The rewrite rules
Results 1  10
of
37,698