A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings

Publisher Website

1 January 2004

book chapter
Published by Springer Nature

p. 280-295
https://doi.org/10.1007/978-3-540-24730-2_23

Abstract

No abstract available

Keywords

This publication has 25 references indexed in Scilit:

Efficient and precise array access analysis
ACM Transactions on Programming Languages and Systems, 2002
The role of commutativity in constraint propagation algorithms
ACM Transactions on Programming Languages and Systems, 2000
A faster solver for general systems of equations
Science of Computer Programming, 1999
Constraint-based array dependence analysis
ACM Transactions on Programming Languages and Systems, 1998
Applying interval arithmetic to real, integer, and boolean constraints
The Journal of Logic Programming, 1997
A practical algorithm for exact array dependence analysis
Communications of the ACM, 1992
Abstract Interpretation Frameworks
Journal of Logic and Computation, 1992
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM, 1981
Static determination of dynamic properties of generalized type unions
ACM SIGOPS Operating Systems Review, 1977
Global Data Flow Analysis and Iterative Algorithms
Journal of the ACM, 1976