A class of polynomially solvable range constraints for interval analysis without widenings

DOI10.1016/j.tcs.2005.07.035zbMath1078.68154OpenAlexW2139960707MaRDI QIDQ2575737

Zhendong Su, David Wagner

Publication date: 6 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.035

zbMATH Keywords

AlgorithmsComplexityInterval analysisRange constraints

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

Why does Astrée scale up? ⋮ A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals ⋮ The two variable per inequality abstract domain ⋮ Acceleration in Convex Data-Flow Analysis ⋮ Polynomial Precise Interval Analysis Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• A faster solver for general systems of equations
• The essence of constraint propagation
• A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
• Deciding Linear Inequalities by Computing Loop Residues
• Global Data Flow Analysis and Iterative Algorithms
• Applying interval arithmetic to real, integer, and boolean constraints
• Analytic constraint solving and interval arithmetic
• Abstract Interpretation Frameworks
• Tools and Algorithms for the Construction and Analysis of Systems
• Diophantine equations, Presburger arithmetic and finite automata