A complexity tradeoff in ranking-function termination proofs
From MaRDI portal
Recommendations
- Ranking Functions for Size-Change Termination II
- Size-change termination, monotonicity constraints and ranking functions
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- scientific article; zbMATH DE number 1903370
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- A general framework for automatic termination analysis od logic programs
- A semantic basis for the termination analysis of logic programs
- Logic Programming
- Proving termination with multiset orderings
- Rewriting Techniques and Applications
- Size-Change Termination and Bound Analysis
- The size-change principle and dependency pairs for termination of term rewriting
- The size-change principle for program termination
- Transition invariants and transition predicate abstraction for program termination
Cited in
(5)- Ranking Abstractions
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Asymptotically precise ranking functions for deterministic size-change systems
- Ranking Functions for Size-Change Termination II
This page was built for publication: A complexity tradeoff in ranking-function termination proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006896)
