@inproceedings{HrushovskiOuakninePoulyWorrell:LICS:2018,
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.},
Address = {New York, NY, USA},
Author = {Hrushovski, Ehud and Ouaknine, Jo\"{e}l and Pouly, Amaury and Worrell, James},
BookTitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
File = {Polynomial Invariants for Affine Programs - 3209108.3209142.pdf},
ISBN = {9781450355834},
Location = {Oxford, United Kingdom},
Pages = {530--539},
Publisher = {Association for Computing Machinery},
Series = {LICS '18},
Title = {Polynomial Invariants for Affine Programs},
URL = {https://doi.org/10.1145/3209108.3209142},
Year = {2018},
bdsk-url-1 = {https://doi.org/10.1145/3209108.3209142},
date-added = {2023-08-03 10:57:05 +0200},
date-modified = {2023-08-03 10:57:31 +0200},
numpages = {10},
doi = {10.1145/3209108.3209142}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A