{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:40:37Z","timestamp":1740336037752,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212997"},{"type":"electronic","value":"9783540247302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_23","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:00:15Z","timestamp":1280761215000},"page":"280-295","source":"Crossref","is-referenced-by-count":12,"title":["A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings"],"prefix":"10.1007","author":[{"given":"Zhendong","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K.R. Apt","year":"1999","unstructured":"Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science\u00a0221(1-2), 179\u2013210 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/371880.371884","volume":"22","author":"K.R. Apt","year":"2000","unstructured":"Apt, K.R.: The role of commutativity in constraint propagation algorithms. ACM Transactions on Programming Languages and Systems\u00a022(6), 1002\u20131036 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/0209063","volume":"9","author":"B. Aspvall","year":"1980","unstructured":"Aspvall, B., Shiloach, Y.: A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing\u00a09(4), 827\u2013845 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F. Benhamou","year":"1997","unstructured":"Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming\u00a032(1), 1\u201324 (1997)","journal-title":"Journal of Logic Programming"},{"key":"23_CR5","unstructured":"Bledsoe, W.W.: The Sup-Inf method in Presburger arithmetic. Technical report, University of Texas Math Dept. (December 1974)"},{"key":"23_CR6","volume-title":"Supercomputing 1994","author":"W. Blume","year":"1994","unstructured":"Blume, W., Eigenmann, R.: The range test: A dependence test for symbolic, non-linear expressions. In: Supercomputing 1994, IEEE Computer Society, Los Alamitos (1994)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/IPPS.1995.395956","volume-title":"Proceedings of the 9th International Symposium on Parallel Processing IPPS 1995","author":"W. Blume","year":"1995","unstructured":"Blume, W., Eigenmann, R.: Symbolic range propagation. In: Proceedings of the 9th International Symposium on Parallel Processing IPPS 1995, Los Alamitos, CA, USA, April 1995, pp. 357\u2013363. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-61064-2_27","volume-title":"Trees in Algebra and Programming - CAAP \u201996","author":"A. Boudet","year":"1996","unstructured":"Boudet, A., Comon, H.: Diophantine equations, Presburger arithmetic and finite automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 30\u201343. Springer, Heidelberg (1996)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: SIGPLAN 1993 Conference on Programming Language Design and Implementation, pp. 46\u201355 (1993)","DOI":"10.1145\/155090.155095"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the 2nd International Symposium on Programming, pp. 106\u2013130 (1976)","DOI":"10.1145\/390018.808314"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: 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, pp. 234\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation\u00a02(4), 511\u2013547 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM Symposium on Principles of Programming Languages, pp. 84\u201397 (1978)","DOI":"10.1145\/512760.512770"},{"issue":"2-3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-6423(99)00009-X","volume":"35","author":"C. Fecht","year":"1999","unstructured":"Fecht, C., Seidl, H.: A faster solver for general systems of equations. Science of Computer Programming\u00a035(2-3), 137\u2013161 (1999)","journal-title":"Science of Computer Programming"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, R.: A fresh look at optimizing array bound checking. In: Proceedings of the Conference on Programming Language Design and Implementation, pp. 272\u2013282 (1990)","DOI":"10.1145\/93542.93581"},{"issue":"4","key":"23_CR16","first-page":"135","volume":"1","author":"R. Gupta","year":"1994","unstructured":"Gupta, R.: Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems\u00a01(4), 135\u2013150 (1994)","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Heintze, N., Jaffar, J.: A decision procedure for a class of Herbrand set constraints. In: Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS), June 1990, pp. 42\u201351 (1990)","DOI":"10.1109\/LICS.1990.113732"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Hickey, T.J.: Analytic constraint solving and interval arithmetic. In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POLP 2000), N.Y., January 19-21, pp. 338\u2013351 (2000)","DOI":"10.1145\/325694.325738"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Hickey, T.J., van Emden, M.H., Wu, H.: A unified framework for interval constraints and interval arithmetic. In: Principles and Practice of Constraint Programming, pp. 250\u2013264 (1998)","DOI":"10.1007\/3-540-49481-2_19"},{"key":"23_CR20","volume-title":"Introduction to Linear Programming","author":"J.P. Ignizio","year":"1994","unstructured":"Ignizio, J.P., Cavalier, T.M.: Introduction to Linear Programming. Prentice-Hall, Englewood Cliffs (1994)"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. Journal of the ACM\u00a023(1), 158\u2013171 (1976)","journal-title":"Journal of the ACM"},{"key":"23_CR22","first-page":"85","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1975","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1975)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Conference Record of the ACM Symposium on Principles of Programming Languages. ACM SIGACT and SIGPLAN, pp. 194\u2013206 (1973)","DOI":"10.1145\/512927.512945"},{"key":"23_CR24","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0049-237X(09)70352-0","volume-title":"Logic, Methodology and Philosophy of Science IV","author":"Y.V. Matijasevi\u010d","year":"1973","unstructured":"Matijasevi\u010d, Y.V.: On recursive unsolvability of Hilbert\u2019s Tenth Problem. In: Suppes, P., et al. (eds.) Logic, Methodology and Philosophy of Science IV. Studies in Logic and the Foundations of Mathematics, vol.\u00a074, pp. 89\u2013110. North-Holland, Amsterdam (1973)"},{"key":"23_CR25","volume-title":"Interval Analysis","author":"R.E. Moore","year":"1963","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1963)"},{"key":"23_CR26","unstructured":"Nelson, G.: An n log n algorithm for the two-variable-per-constraint linear programming satisfiability problem. Technical Report STAN-CS-78-689, Stanford University (1978)"},{"key":"23_CR27","unstructured":"Nelson, G.: Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center (1981)"},{"key":"23_CR28","first-page":"175","volume-title":"Constraint Logic Programming: Selected Research","author":"W.J. Older","year":"1993","unstructured":"Older, W.J., Velino, A.: Constraint arithmetic on real intervals. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming: Selected Research, pp. 175\u2013196. MIT Press, Cambridge (1993)"},{"issue":"1","key":"23_CR29","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/509705.509708","volume":"24","author":"Y. Paek","year":"2002","unstructured":"Paek, Y., Hoeflinger, J., Padua, D.A.: Efficient and precise array access analysis. ACM Transactions on Programming Languages and Systems\u00a024(1), 65\u2013109 (2002)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR30","unstructured":"Pratt, V.R.: Two easy theories whose combination is hard (1977) (unpublished manuscript)"},{"issue":"8","key":"23_CR31","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM\u00a035(8), 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"issue":"3","key":"23_CR32","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/291889.291900","volume":"20","author":"W. Pugh","year":"1998","unstructured":"Pugh, W.: Constraint-based array dependence analysis. ACM Transactions on Programming Languages and Systems\u00a020(3), 635\u2013678 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR33","unstructured":"Seater, R., Wonnacott, D.: Polynomial time array dataflow analysis. In: Languages and Compilers for Parallel Computing, LCPC (2001)"},{"issue":"4","key":"23_CR34","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1145\/322276.322288","volume":"28","author":"R. Shostak","year":"1981","unstructured":"Shostak, R.: Deciding linear inequalities by computing loop residues. Journal of the ACM\u00a028(4), 769\u2013779 (1981)","journal-title":"Journal of the ACM"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Suzuki, N., Ishihata, K.: Implementation of an array bound checker. In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, January 17-19. ACM SIGACT-SIGPLAN, pp. 132\u2013143 (1977)","DOI":"10.1145\/512950.512963"},{"key":"23_CR36","unstructured":"Wagner, D., Foster, J.S., Brewer, E.A., Aiken, A.: A first step towards automated detection of buffer overrun vulnerabilities. In: Symposium on Network and Distributed Systems Security (NDSS 2000), San Diego, CA, February 2000. Internet Society, pp. 3\u201317 (2000)"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Wolper, P., Boigelot, B.: An automata-theoretic approach to presburger arithmetic constraints. In: Static Analysis Symposium, pp. 21\u201332 (1995)","DOI":"10.1007\/3-540-60360-3_30"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Xi, H., Pfenning, F.: Eliminating array bound checking through dependent types. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, June 17-19, pp. 249\u2013257 (1998)","DOI":"10.1145\/277650.277732"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24730-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T17:59:48Z","timestamp":1740333588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}