An Abstract Domain to Infer Ordinal-Valued Ranking Functions
From MaRDI portal
Publication:5410712
DOI10.1007/978-3-642-54833-8_22zbMath1405.68094OpenAlexW45151810MaRDI QIDQ5410712
Publication date: 16 April 2014
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54833-8_22
Related Items
Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting ⋮ Constraint-based relational verification ⋮ Reflections on termination of linear loops ⋮ Decision tree learning in CEGIS-based termination analysis ⋮ Combining Model Checking and Data-Flow Analysis ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ Inference of ranking functions for proving temporal properties by abstract interpretation ⋮ A decision tree lifted domain for analyzing program families with numerical features ⋮ Temporal prophecy for proving temporal properties of infinite-state systems
Uses Software