Certifying a Termination Criterion Based on Graphs, without Graphs
From MaRDI portal
Recommendations
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards a systematic method for proving termination of graph transformation systems
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Reachability predicates for graph assertions
- Termination proofs and complexity certification
- scientific article; zbMATH DE number 1183250
- Certifying coloring algorithms for graphs without long induced paths
- Non-simplifying graph rewriting termination
- Termination detection of distributed algorithms by graph relabelling systems
- Termination analysis for graph transformation systems
Cites work
- Argument filtering transformation
- Automating the dependency pair method.
- Certification of Automated Termination Proofs
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Mechanizing and improving dependency pairs
- Modeling Permutations in Coq for Coccinelle
- Proving innermost normalisation automatically
- Term Rewriting and All That
- Termination of term rewriting using dependency pairs
- Tyrolean termination tool
- Verification of Erlang processes by dependency pairs
Cited in
(3)
This page was built for publication: Certifying a Termination Criterion Based on Graphs, without Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543658)