Termination criteria for DPO transformations with injective matches

DOI10.1016/J.ENTCS.2007.04.019zbMATH Open1278.68123OpenAlexW2001704173WikidataQ114182438 ScholiaQ114182438MaRDI QIDQ2867892FDOQ2867892

Ulrike Prange, Tihamér Levendovszky, Hartmut Ehrig

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.04.019

Recommendations

• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• Transition invariants and transition predicate abstraction for program termination
• Automatic termination proofs with transformation orderings
• Termination of term rewriting using dependency pairs
• Termination proofs for string rewriting systems via inverse match-bounds
• Characterizing and proving operational termination of deterministic conditional term rewriting systems
• Correctness of program transformations as a termination problem
• A Transformational Approach to Prove Outermost Termination Automatically
• scientific article; zbMATH DE number 4180808

zbMATH Keywords

graph transformationmodel transformationtermination criteriaDPO approach

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Cites Work

• Fundamentals of algebraic graph transformation
• Fundamental Approaches to Software Engineering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Diagrammatic Representation and Inference

Cited In (4)

• Title not available (Why is that?)
• Explicit State Model Checking for Graph Grammars
• Fundamental Approaches to Software Engineering
• Towards a Systematic Method for Proving Termination of Graph Transformation Systems

This page was built for publication: Termination criteria for DPO transformations with injective matches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867892)