Termination of triangular Integer loops is decidable
From MaRDI portal
Publication:6194959
DOI10.1007/978-3-030-25543-5_24arXiv1905.08664OpenAlexW2957046311MaRDI QIDQ6194959
Publication date: 16 February 2024
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.08664
Related Items
Reflections on termination of linear loops, Automatic discovery of fair paths in infinite-state transition systems, Proving the existence of fair paths in infinite-state systems, Computing expected runtimes for constant probability programs, Automatic complexity analysis of integer programs via triangular weakly non-linear loops