Asymptotically precise ranking functions for deterministic size-change systems

DOI10.1007/978-3-319-20297-6_27MaRDI QIDQ3194732zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Ranking Functions for Size-Change Termination II
• The size-change principle for program termination
• Size-change termination, monotonicity constraints and ranking functions
• Size-Change Termination, Monotonicity Constraints and Ranking Functions
• scientific article; zbMATH DE number 2018591

Cites work

• A complexity tradeoff in ranking-function termination proofs
• Affine-based size-change termination.
• Certified Size-Change Termination
• Lazy abstraction for size-change termination
• Monotonicity constraints for termination in the integer domain
• Ranking Functions for Size-Change Termination II
• Size-Change Abstraction and Max-Plus Automata
• Termination Analysis with Calling Context Graphs
• The size-change principle for program termination

Cited in

(2)

• Programming Languages and Systems
• Type-based analysis of logarithmic amortised complexity

This page was built for publication: Asymptotically precise ranking functions for deterministic size-change systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194732)