Termination of real linear and affine loops is decidable on all robust instances via sound partial algorithms, with non-robust instances having Lebesgue measure zero.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Termination of Real Linear Loops
Termination of real linear and affine loops is decidable on all robust instances via sound partial algorithms, with non-robust instances having Lebesgue measure zero.