On Deciding Constant Runtime of Linear Loops
No abstract available.
Related papers
- Simple Linear Loops: Algebraic Invariants and Applications POPL 2025
- What's decidable about linear loops? POPL 2022
- Deciding ω-regular properties on linear recurrence sequences POPL 2021
- On the Termination of Integer Loops TOPLAS 2012
- Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates CAV 2024
- On the linear ranking problem for integer linear-constraint loops POPL 2013
- Decidable verification of uninterpreted programs POPL 2019
- Polynomial Constants Are Decidable SAS 2002