O-minimal invariants for linear loops
The termination analysis of linear loops plays a key rôle in several areas of computer science, including program verification and abstract interpretation. Such deceptively simple questions also relate to a number of deep open problems, such as the decidability of the Skolem and Positivity Problems...
| Автори: | , , , |
|---|---|
| Формат: | Conference item |
| Опубліковано: |
Leibniz Center for Informatics
2018
|