Termination criteria for DPO transformations with injective matches
From MaRDI portal
(Redirected from Publication:2867892)
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
Cites work
Cited in
(6)- Towards a systematic method for proving termination of graph transformation systems
- Termination of graph transformation systems via generalized weighted type graphs
- scientific article; zbMATH DE number 7456054 (Why is no real title available?)
- Explicit State Model Checking for Graph Grammars
- Fundamental Approaches to Software Engineering
- Combining termination criteria by isolating deletion
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)