A framework merges round-off error analysis and polynomial constraint solving to generate tight invariants for floating-point programs and outperforms prior methods on benchmarks.
The mapping from terms to degrees is: {x: 1,−x: 1,1 +i: 1,1−i: 1} leading to the additional map: {1 : 0, x 2 : 2,−x 2 : 2, x(1 +i) : 2, x(1−i) : 2,−x(1 +i) : 2,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial Invariant Generation for Floating-Point Programs
A framework merges round-off error analysis and polynomial constraint solving to generate tight invariants for floating-point programs and outperforms prior methods on benchmarks.