O-minimal invariants for discrete-time dynamical systems
Termination analysis of linear loops plays a key rôle in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination relates to deep open problems in number theory, such as the decidabili...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Association for Computing Machinery
2022
|