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.
Scalable linear invariant generation with farkas’ lemma.Proc
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.