Searching for "On Termination of Graph Rewriting." – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Termination Of Graph Rewriting Is Undecidable
- …Fundamenta Informaticae 33(2), 1998, 201--209 1 IOS Press Termination of graph rewriting…
- Cited by 6 (1 self) – Add To MetaCart
-
On Termination of Single-Pushout Graph Rewriting
- …On Termination of Single-Pushout Graph Rewriting Jurgen Muller October 1, 1996 Abstract A…
- Cited by 1 (1 self) – Add To MetaCart
-
Confluence of graph transformation revisited
- … that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast…
- Cited by 1 (0 self) – Add To MetaCart
-
Termination of HighLevel Replacement Units with Application to Model Transformation
- … in [16], that termination of graph rewriting is undecidable in general, they provide some intuitive…
- Cited by 4 (2 self) – Add To MetaCart
-
Computing by Graph Transformation II (COMPUGRAPH II)
- … condition for termination of graph rewriting systems is established by Plump [Plu95]. Termination…
- Add To MetaCart
-
How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems
- …. Larger graph rewrite systems tend to loose confluence or termination. With a suitable separation one can…
- Cited by 6 (0 self) – Add To MetaCart
-
OPTIMIX Language Report (for OPTIMIX 7.0)
- … systems (EARS) and general terminating graph rewrite systems (GRS). EARS are equivalent to Datalog…
- Add To MetaCart
-
Verifying red-black trees
- … of balanced search trees—using analysis techniques developed for graph rewriting. We first model red…
- Cited by 6 (3 self) – Add To MetaCart
Showing 1 through 8.
