Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems

DOI10.1007/978-3-319-20297-6_27zbMath1465.68053OpenAlexW2218585456MaRDI QIDQ3194732

Florian Zuleger

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Type-based analysis of logarithmic amortised complexity

Cites Work

• A complexity tradeoff in ranking-function termination proofs
• Size-Change Abstraction and Max-Plus Automata
• Monotonicity Constraints for Termination in the Integer Domain
• Certified Size-Change Termination
• Ranking Functions for Size-Change Termination II
• Lazy Abstraction for Size-Change Termination
• The size-change principle for program termination
• Termination Analysis with Calling Context Graphs
• Programming Languages and Systems

This page was built for publication: Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems