Proving Conditional Termination
From MaRDI portal
Publication:3512502
DOI10.1007/978-3-540-70545-1_32zbMath1155.68431OpenAlexW1925379677MaRDI QIDQ3512502
Andrey Rybalchenko, Sumit Gulwani, Mooly Sagiv, Byron Cook, Tal Lev-Ami
Publication date: 15 July 2008
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_32
Related Items (11)
Reflections on termination of linear loops ⋮ Termination of Single-Path Polynomial Loop Programs ⋮ Convergence: integrating termination and abort-freedom ⋮ Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods ⋮ A versatile concept for the analysis of loops ⋮ Proving Termination Through Conditional Termination ⋮ Inference of ranking functions for proving temporal properties by abstract interpretation ⋮ Loop summarization using state and transition invariants ⋮ A new look at the automatic synthesis of linear ranking functions ⋮ All-Termination(T) ⋮ Discovering non-terminating inputs for multi-path polynomial programs
This page was built for publication: Proving Conditional Termination