On Strongest Algebraic Program Invariants
On Strongest Algebraic Program Invariants
复制标题
关于最强代数程序不变量
DOI:
10.1145/3614319
复制
发表时间:
2023
影响因子:
2.5
通讯作者:
Hrushovski E
中科院分区:
文献类型:
--
作者:
Hrushovski E
A polynomial program is one in which all assignments are given by polynomial expressions and in which all branching is nondeterministic (as opposed to conditional). Given such a program, an algebraic invariant is one that is defined by polynomial equations over the program variables at each program location. Müller-Olm and Seidl have posed the question of whether one can compute the strongest algebraic invariant of a given polynomial program. In this article, we show that, while strongest algebraic invariants are not computable in general, they can be computed in the special case of affine programs, that is, programs with exclusively linear assignments. For the latter result, 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.
登录
查看更多内容
影响因子:
1.7
作者:
P. Koiran
通讯作者:
P. Koiran
DOI:
--
发表时间:
2021
期刊:
International Symposium on Symbolic and Algebraic Computation
影响因子:
--
作者:
Klara Nosan;Amaury Pouly;S. Schmitz;M. Shirmohammadi;J. Worrell
通讯作者:
J. Worrell
DOI:
--
发表时间:
2016
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
I. Potapov;P. Semukhin
通讯作者:
P. Semukhin
影响因子:
0.5
作者:
Nathanaël Fijalkow;Pierre Ohlmann;Joël Ouaknine;Amaury Pouly;J. Worrell
通讯作者:
J. Worrell
DOI:
--
发表时间:
2017
期刊:
Symposium on Theoretical Aspects of Computer Science
影响因子:
--
作者:
Nathanaël Fijalkow;Pierre Ohlmann;Joël Ouaknine;Amaury Pouly;J. Worrell
通讯作者:
J. Worrell