Ranking Abstractions

DOI10.1007/978-3-540-78739-6_13MaRDI QIDQ5458393zbMATH OpenOpenAlexFDO

Authors Aziem Chawdhary, Byron Cook, Sumit Gulwani, Mooly Sagiv, Hongseok Yang

Publication date 11 April 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78739-6_13

Mathematics Subject Classification ID

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

Recommendations

• An abstract domain to infer ordinal-valued ranking functions
• scientific article; zbMATH DE number 1903370
• A complexity tradeoff in ranking-function termination proofs
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• MODULAR RANKING ABSTRACTION

Cited in

(10)

• Convergence: integrating termination and abort-freedom
• Loop summarization using state and transition invariants
• Loop Summarization and Termination Analysis
• Abstract Interpretation with Applications to Timing Validation
• A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
• Proving Termination of Integer Term Rewriting
• Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• An abstract domain to infer ordinal-valued ranking functions
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Ranking Abstractions

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