Polynomial invariants for affine programs
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 too...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Association for Computing Machinery
2018
|