Ranking Functions for Size-Change Termination II
From MaRDI portal
Publication:3636808
DOI10.2168/LMCS-5(2:8)2009zbMath1163.68318arXiv0903.4382OpenAlexW3101904855MaRDI QIDQ3636808
Chin Soon Lee, Amir M. Ben-Amram
Publication date: 30 June 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.4382
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems, Loop Summarization and Termination Analysis, Loop summarization using state and transition invariants, All-Termination(T), A SAT-Based Approach to Size Change Termination with Global Ranking Functions