Conference item icon

Conference item

O-minimal invariants for linear loops

Abstract:

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 for linear recurrence sequences, or equivalently reachability questions for discrete-time linear dynamical systems. In this paper, we introduce the class of o-minimal invariants, which is broader t...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.4230/LIPIcs.ICALP.2018.114

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
St John's College
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
Publisher:
Leibniz Center for Informatics Publisher's website
Journal:
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) Journal website
Host title:
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Publication date:
2018-06-29
Acceptance date:
2018-04-19
DOI:
Source identifiers:
842323
Keywords:
Pubs id:
pubs:842323
UUID:
uuid:ccc28084-53c3-4a01-b62c-29aa7bdfadee
Local pid:
pubs:842323
Deposit date:
2018-04-19

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP