Alternation for Termination

DOI10.1007/978-3-642-15769-1_19zbMath1306.68027OpenAlexW2096096565MaRDI QIDQ4930735

Akash Lal, William R. Harris, 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)

Related Items (6)

Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ Proving Termination Through Conditional Termination ⋮ Extended Nested Dual System Groups, Revisited ⋮ Temporal prophecy for proving temporal properties of infinite-state systems ⋮ Ranking Functions for Linear-Constraint Loops ⋮ Discovering non-terminating inputs for multi-path polynomial programs

Uses Software

• TREX

This page was built for publication: Alternation for Termination