{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:41Z","timestamp":1794381101221,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540227915","type":"print"},{"value":"9783540278641","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27864-1_12","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T12:35:37Z","timestamp":1284640537000},"page":"133-148","source":"Crossref","is-referenced-by-count":11,"title":["Pointer-Range Analysis"],"prefix":"10.1007","author":[{"given":"Suan Hsi","family":"Yong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susan","family":"Horwitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Balakrishnan, G., Reps, T.: Analyzing memory accesses in x86 executables. In: International Conference on Compiler Construction, Barcelona, Spain (March 2004)","DOI":"10.1007\/978-3-540-24723-4_2"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Blume, W., Eigenmann, R.: Demand-driven, symbolic range propagation. In: 8th International workshop on Languages and Compilers for Parallel Computing, pp. 141\u2013160, Columbus, OH (August 1995)","DOI":"10.1007\/BFb0025876"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bodik, R., Gupta, R., Sarkar, V.: ABCD: Eliminating array bounds checks on demand. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, BC, June 2000, pp. 321\u2013333 (2000)","DOI":"10.1145\/349299.349342"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Carlisle, M.C., Rogers, A.: Software caching and computation migration in Olden. Technical Report TR-483-95, Princeton University (1995)","DOI":"10.1145\/209936.209941"},{"key":"12_CR5","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: ACM Symposium on Principles of Programming Languages, April 1976, pp. 106\u2013130 (1976)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: ACM Symposium on Principles of Programming Languages, Januany 1978, pp. 84\u201396 (1978)","DOI":"10.1145\/512760.512770"},{"issue":"6","key":"12_CR7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF03356758","volume":"24","author":"B. Creusillet","year":"1996","unstructured":"Creusillet, B., Irigoin, F.: Interprocedural array region analyses. International Journal of Parallel Programming\u00a024(6), 513\u2013546 (1996)","journal-title":"International Journal of Parallel Programming"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, BC, June 2000, pp. 35\u201346 (2000)","DOI":"10.1145\/349299.349309"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-47764-0_12","volume-title":"Static Analysis","author":"N. Dor","year":"2001","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: Cleanness checking of string manipulations in C programs via integer analysis. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, p. 194. Springer, Heidelberg (2001)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Emami, M., Ghiya, R., Hendren, L.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Orlando, FL, June 1994, pp. 242\u2013256 (1994)","DOI":"10.1145\/178243.178264"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Gu, J., Li, Z., Lee, G.: Symbolic array dataflow analysis for array privatization and program parallelization. In: ACM\/IEEE Conference on Supercomputing, San Diego, CA (December 1995)","DOI":"10.1145\/224170.224318"},{"key":"12_CR12","first-page":"139","volume-title":"International Conference on Parallel Architectures and Compilation Techniques (PACT)","author":"M. Gupta","year":"1999","unstructured":"Gupta, M., Mukhopadhyay, S., Sinha, N.: Automatic parallelization of recursive procedures. In: International Conference on Parallel Architectures and Compilation Techniques (PACT), Newport Beach, CA, October 1999, pp. 139\u2013148. IEEE Computer Society, Los Alamitos (1999)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TSE.1977.231133","volume":"SE-3","author":"W.H. Harrison","year":"1977","unstructured":"Harrison, W.H.: Compiler analysis of the value ranges for variables. IEEE Transactions on Software Engineering\u00a0SE-3, 243\u2013250 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/71.86110","volume":"2","author":"P. Havlak","year":"1991","unstructured":"Havlak, P., Kennedy, K.: An implementation of interprocedural bounded regular section analysis. IEEE Transactions of Parallel and Distributed Computing\u00a02(3), 350\u2013360 (1991)","journal-title":"IEEE Transactions of Parallel and Distributed Computing"},{"key":"12_CR15","unstructured":"Jim, T., Morrisett, G., Grossman, D., Hicks, M., Cheney, J., Wang, Y.: Cyclone: A safe dialect of C. In: USENIX Annual Technical Conference, Monterey, CA (June 2002)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural pointer aliasing. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, San Francisco, CA, June 1992, pp. 235\u2013248 (1992)","DOI":"10.1145\/143103.143137"},{"key":"12_CR17","unstructured":"Larochelle, D., Evans, D.: Statically detecting likely buffer overflow vulnerabilities. In: USENIX Security Symposium, Washington, D.C. (August. 2001)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-49051-7_5","volume-title":"Compiler Construction","author":"F. Martin","year":"1999","unstructured":"Martin, F.: Experimental comparison of call string and functional approaches to interprocedural analysis. In: J\u00e4hnichen, S. (ed.) CC 1999. LNCS, vol.\u00a01575, pp. 63\u201375. Springer, Heidelberg (1999)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Patterson, J.R.C.: Accurate static branch prediction by value range propagation. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995, pp. 67\u201378 (1995)","DOI":"10.1145\/207110.207117"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/291889.291900","volume":"20","author":"W. Pugh","year":"1998","unstructured":"Pugh, W., Wonnacott, D.: 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":"12_CR21","doi-asserted-by":"crossref","unstructured":"Rugina, R., Rinard, M.: Symbolic bounds analysis of pointers, array indices, and accessed memory regions. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, BC, June 2000, pp. 182\u2013195 (2000)","DOI":"10.1145\/349299.349325"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Stephenson, M., Babb, J., Amarasinghe, S.: Bitwidth analysis with application to silicon compilation. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, BC, June 2000, pp. 108\u2013120 (2000)","DOI":"10.1145\/358438.349317"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-24730-2_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Z. Su","year":"2004","unstructured":"Su, Z., Wagner, D.: A class of polynomially solvable range constraints for interval analysis without widenings and narrowings. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 280\u2013295. Springer, Heidelberg (2004)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-61053-7_54","volume-title":"Compiler Construction","author":"C. Verbrugge","year":"1996","unstructured":"Verbrugge, C., Co, P., Hendren, L.: Generalized constant propagation: A study in C. In: Gyim\u00f3thy, T. (ed.) CC 1996. LNCS, vol.\u00a01060, pp. 74\u201390. Springer, Heidelberg (1996)"},{"key":"12_CR25","unstructured":"Wagner, D., Foster, J., Brewer, E., Aiken, A.: A first step towards automated detection of buffer overrun vulnerabilities. In: Symposium on Network and Distributed Systems Security, San Diego, CA, February 2000, pp. 3\u201317 (2000)"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/spe.4380080110","volume":"8","author":"J. Welsh","year":"1978","unstructured":"Welsh, J.: Economic range checks in Pascal. Software\u2013Practice and Experience\u00a08, 85\u201397 (1978)","journal-title":"Software\u2013Practice and Experience"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for C programs. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995, pp. 1\u201312 (1995)","DOI":"10.1145\/207110.207111"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27864-1_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:39Z","timestamp":1605741879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99688","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}