A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings
No abstract available.
DOI 10.1007/978-3-540-24730-2_23
Related papers
- Accelerated Data-Flow Analysis SAS 2007
- Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis POPL 2024
- How to combine widening and narrowing for non-monotonic systems of equations PLDI 2013
- Localizing Widening and Narrowing SAS 2013
- Invariant Generation for Multi-Path Loops with Polynomial Assignments VMCAI 2018
- Analytic Constraint Solving and Interval Arithmetic POPL 2000
- Taming and Dissecting Recursions Through Interprocedural Weak Topological Ordering ECOOP 2025
- Reasoning Algebraically About P-Solvable Loops TACAS 2008