Alternation for termination

DOI10.1007/978-3-642-15769-1_19MaRDI QIDQ4930735zbMATH OpenOpenAlexFDO

Authors William R. Harris, Akash Lal, Aditya V. Nori, Sriram K. Rajamani

Publication date 1 October 2010

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15769-1_19

Mathematics Subject Classification ID

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

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• Syntax-guided termination analysis
• Proving termination through conditional termination
• TERMINATION ANALYSIS OF LINEAR LOOPS
• Proving non-termination

Cited in

(9)

• Temporal prophecy for proving temporal properties of infinite-state systems
• Discovering non-terminating inputs for multi-path polynomial programs
• Automatically proving termination and memory safety for programs with pointer arithmetic
• Extended Nested Dual System Groups, Revisited
• Proving non-termination
• Proving termination through conditional termination
• Termination for Hybrid Tableaus
• Ranking functions for linear-constraint loops
• Summarization for termination: No return!

Describes a project that uses

Uses Software

• TREX

This page was built for publication: Alternation for termination

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