A complexity tradeoff in ranking-function termination proofs

DOI10.1007/s00236-008-0085-0zbMath1172.68013OpenAlexW2093424728MaRDI QIDQ1006896

Amir M. Ben-Amram

Publication date: 26 March 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-008-0085-0

zbMATH Keywords

size-change termination

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems

Cites Work

• Unnamed Item
• Unnamed Item
• The size-change principle and dependency pairs for termination of term rewriting
• Transition Invariants and Transition Predicate Abstraction for Program Termination
• Size-Change Termination and Bound Analysis
• Proving termination with multiset orderings
• A semantic basis for the termination analysis of logic programs
• The size-change principle for program termination
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions
• Logic Programming
• Rewriting Techniques and Applications
• A general framework for automatic termination analysis od logic programs

This page was built for publication: A complexity tradeoff in ranking-function termination proofs