Size-Change Termination and Bound Analysis
From MaRDI portal
Recommendations
Cited in
(11)- A complexity tradeoff in ranking-function termination proofs
- The strength of the SCT criterion
- scientific article; zbMATH DE number 1953270 (Why is no real title available?)
- scientific article; zbMATH DE number 2018591 (Why is no real title available?)
- Size-change termination and transition invariants
- The size-change principle for program termination
- The size-change termination principle for constructor based languages
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Affine-based size-change termination.
- Complete and tractable machine-independent characterizations of second-order polytime
- Complete and tractable machine-independent characterizations of second-order polytime
This page was built for publication: Size-Change Termination and Bound Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434633)