Conference Paper/Proceeding/Abstract 4 views
Termination of Real Linear Loops
Eike Neumann 
,
Margret Tembo
,
Margret Tembo
Lecture Notes in Computer Science
Swansea University Authors:
Eike Neumann , Margret Tembo
Abstract
We study the problem of deciding universal termination of linear and and affine loops over the reals in the bit-model of real computation. We show that both problems are as close to decidable as one can expect them to be: there exist sound partial algorithms that halt on all problem instances whose...
| Published in: | Lecture Notes in Computer Science |
|---|---|
| Published: |
Springer
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa72063 |
| Abstract: |
We study the problem of deciding universal termination of linear and and affine loops over the reals in the bit-model of real computation. We show that both problems are as close to decidable as one can expect them to be: there exist sound partial algorithms that halt on all problem instances whose answer is robust under all sufficiently small perturbations. We further show that in each case the set of non-robust problem instances has Lebesgue measure zero. |
|---|---|
| College: |
Faculty of Science and Engineering |