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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2988, Issue , 2004, Pages 280-295

  Su, Zhendong ^a   Wagner, David ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

ABSTRACT INTERPRETATION TECHNIQUES; INTERVAL ANALYSIS; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIALLY SOLVABLE; RANGE CONSTRAINTS; STATIC PROGRAM ANALYSIS;

POLYNOMIALS;

EID: 33749829676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_23     Document Type: Article

References (38)

1. K.R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1-2): 179-210, June 1999.
2. K.R. Apt. The role of commutativity in constraint propagation algorithms. ACM Transactions on Programming Languages and Systems, 22(6):1002-1036, 2000.
3. B. Aspvall and Y. Shiloach. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing, 9(4):827-845, 1980.
4. F. Benhamou and W.J. Older. Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming, 32(1):1-24, July 1997.
5. W.W. Bledsoe. The Sup-Inf method in Presburger arithmetic. Technical report, University of Texas Math Dept., December 1974.
6. W. Blume and R. Eigenmann. The range test: A dependence test for symbolic, non-linear expressions. In Supercomputing '94. IEEE Computer Society, 1994.
7. W. Blume and R. Eigenmann. Symbolic range propagation. In Proceedings of the 9th International Symposium on Parallel Processing (IPPS'95, pages 357-363, Los Alamitos, CA, USA, April 1995. IEEE Computer Society Press.
8. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Proceedings of Trees in Algebra and Programming (CAAP'96), volume 1059 of Lecture Notes in Computer Science, pages 30-43. Springer-Verlag, 1996.
9. F. Bourdoncle. Abstract debugging of higher-order imperative languages. In SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 46-55, 1993.
10. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the 2nd International Symposium on Programming, pages 106-130, 1976.
11. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pages 234-252, 1977.
12. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511-547, 1992.
13. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th ACM Symposium on Principles of Programming Languages, pages 84-97, 1978.
14. C. Fecht and H. Seidl. A faster solver for general systems of equations. Science of Computer Programming, 35(2-3):137-161, November 1999.
15. R. Gupta. A fresh look at optimizing array bound checking. In Proceedings of the Conference on Programming Language Design and Implementation, pages 272-282, 1990.
16. R. Gupta. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems, 1(4):135-150, March-December 1994.
17. N. Heintze and J. Jaffar. A decision procedure for a class of Herbrand set constraints. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 42-51, June 1990.
18. T.J. Hickey. Analytic constraint solving and interval arithmetic. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POLP-00), pages 338-351, N.Y., January 19-21 2000.
19. T.J. Hickey, M.H. van Emden, and H. Wu. A unified framework for interval constraints and interval arithmetic. In Principles and Practice of Constraint Programming, pages 250-264, 1998.
20. J.P. Ignizio and T.M. Cavalier. Introduction to Linear Programming. Prentice-Hall, 1994.
21. J.B. Kam and J.D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1):158-171, January 1976.
22. R.M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1975.
23. G.A. Kildall. A unified approach to global program optimization. In Conference Record of the ACM Symposium on Principles of Programming Languages, pages 194-206. ACM SIGACT and SIGPLAN, 1973.
24. Y.V. Matijaseviĉ. On recursive unsolvability of Hilbert's Tenth Problem. In Patrick Suppes et al., editors, Logic, Methodology and Philosophy of Science IV, volume 74 of Studies in Logic and the Foundations of Mathematics, pages 89-110, Amsterdam, 1973. North-Holland.
25. R.E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, New York, 1963.
26. log n algorithm for the two-variable-per- constraint linear programming sat-isfiability problem. Technical Report STAN-CS-78-689, Stanford University, 1978.
27. G. Nelson. Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center, 1981.
28. W.J. Older and A. Velino. Constraint arithmetic on real intervals. In Frédéric Benhamou and Alain Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 175-196. MIT Press, 1993.
29. Y. Paek, J. Hoeflinger, and D.A. Padua. Efficient and precise array access analysis. ACM Transactions on Programming Languages and Systems, 24(1):65-109, 2002.
30. V.R. Pratt. Two easy theories whose combination is hard. Unpublished manuscript, 1977.
31. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 35(8):102-114, August 1992.
32. W. Pugh. Constraint-based array dependence analysis. ACM Transactions on Programming Languages and Systems, 20(3):635-678, May 1998.
33. R. Seater and D. Wonnacott. Polynomial time array dataflow analysis. In Languages and Compilers for Parallel Computing (LCPC), 2001.
34. R. Shostak. Deciding linear inequalities by computing loop residues. Journal of the ACM, 28(4):769-779, October 1981.
35. N. Suzuki and K. Ishihata. Implementation of an array bound checker. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 132-143, Los Angeles, California, January 17-19, 1977. ACM SIGACT-SIGPLAN.
36. D. Wagner, J.S. Foster, E.A. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In Symposium on Network and Distributed Systems Security (NDSS '00), pages 3-17, San Diego, CA, February 2000. Internet Society.
37. P. Wolper and B. Boigelot. An automata-theoretic approach to presburger arithmetic constraints. In Static Analysis Symposium, pages 21-32, 1995.
38. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation (PLDI), pages 249-257, Montreal, Canada, 17-19 June 1998.