The 2-dimensional constraint loop problem is decidable

DOI10.4230/LIPICS.ICALP.2024.140MaRDI QIDQ6875038zbMATH OpenFDO

Authors Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.140

zbMATH Keywords

asymptotic expansionsconvex setslinear constraints loopsMinkowski-Weyl

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Computer Aided Verification
• Deciding conditional termination
• Geometric nontermination arguments
• Multiphase-linear ranking functions and their relation to recurrent sets
• Ranking functions for linear-constraint loops
• Termination of Integer Linear Programs
• Termination of linear loops over the integers
• The 2-dimensional constraint loop problem is decidable

Cited in

(1)

• The 2-dimensional constraint loop problem is decidable

This page was built for publication: The 2-dimensional constraint loop problem is decidable

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