Ramsey vs. Lexicographic Termination Proving

DOI10.1007/978-3-642-36742-7_4zbMath1381.68050OpenAlexW1589106570MaRDI QIDQ5326314

Byron Cook, Abigail See, Florian Zuleger

Publication date: 5 August 2013

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36742-7_4

Mathematics Subject Classification ID

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

Related Items (7)

Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Predicate Abstraction for Program Verification ⋮ Termination of Single-Path Polynomial Loop Programs ⋮ Convergence: integrating termination and abort-freedom ⋮ Unnamed Item ⋮ Temporal prophecy for proving temporal properties of infinite-state systems ⋮ Ranking Functions for Linear-Constraint Loops

This page was built for publication: Ramsey vs. Lexicographic Termination Proving