Journal article
O-minimal invariants for discrete-time dynamical systems
- Abstract:
-
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 decidability of the Skolem and Positivity Problems for linear recurrence sequences, or equivalently reachability questions for discrete-time linear dynamical systems. In this article, we introduce the class ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, 712.6KB, Terms of use)
-
- Publisher copy:
- 10.1145/3501299
Authors
Bibliographic Details
- Publisher:
- Association for Computing Machinery
- Journal:
- ACM Transactions on Computational Logic More from this journal
- Volume:
- 23
- Issue:
- 2
- Article number:
- 9
- Publication date:
- 2022-01-14
- Acceptance date:
- 2021-11-01
- DOI:
- EISSN:
-
1557-945X
- ISSN:
-
1529-3785
Item Description
- Language:
-
English
- Keywords:
- Pubs id:
-
1246426
- Local pid:
-
pubs:1246426
- Deposit date:
-
2022-04-06
Terms of use
- Copyright holder:
- Almagor et al
- Copyright date:
- 2022
- Rights statement:
- © 2022 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution International 4.0 License.
- Licence:
- CC Attribution (CC BY)
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record