Conference item
Polynomial invariants for affine programs
- Abstract:
- We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose assignments are given by affine expressions). Our main tool is an algebraic result of independent interest: given a finite set of rational square matrices of the same dimension, we show how to compute the Zariski closure of the semigroup that they generate.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 785.3KB)
-
- Publisher copy:
- 10.1145/3209108.3209142
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Association for Computing Machinery Publisher's website
- Journal:
- ACM/IEEE Symposium on Logic in Computer Science (LICS) 2018 Journal website
- Pages:
- 530-539
- Host title:
- LICS '18 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
- Publication date:
- 2018-07-09
- Acceptance date:
- 2018-01-19
- Event location:
- Oxford, UK
- DOI:
- Source identifiers:
-
842302
- ISBN:
- 9781450355834
Item Description
- Pubs id:
-
pubs:842302
- UUID:
-
uuid:a0ede316-9a1d-40f7-8a3b-02eae1520e56
- Local pid:
- pubs:842302
- Deposit date:
- 2018-04-19
Terms of use
- Copyright holder:
- Association for Computing Machinery
- Copyright date:
- 2018
- Notes:
- Copyright © 2018 Association for Computing Machinery. This is the accepted manuscript version of the paper. The final version is available online from ACM at: https://doi.org/10.1145/3209108.3209142
If you are the owner of this record, you can report an update to it here: Report update to this record