{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T02:50:33Z","timestamp":1761706233341},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418610"},{"type":"electronic","value":"9783540453062"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45306-7_10","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T18:55:18Z","timestamp":1193511318000},"page":"133-149","source":"Crossref","is-referenced-by-count":32,"title":["Interprocedural Shape Analysis for Recursive Programs"],"prefix":"10.1007","author":[{"given":"Noam","family":"Rinetzky","sequence":"first","affiliation":[]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"U. Assmann and M. Weinhardt. Interprocedural heap analysis for parallelizing imperative programs. In W. K. Giloi, S. Jahnichen, and B. D. Shriver, editors, Programming Models For Massively Parallel Computers, September 1993.","DOI":"10.1109\/PMMP.1993.315553"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"D.R. Chase, M. Wegman, and F. Zadeck. Analysis of pointers and structures. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 296\u2013310, 1990.","DOI":"10.1145\/93542.93585"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., pages 269\u2013282, New York, NY, 1979. ACM Press.","DOI":"10.1145\/567752.567778"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In Symp. on Princ. of Prog. Lang., 1990.","DOI":"10.1145\/96709.96725"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"N. Dor, M. Rodeh, and M. Sagiv. Checking cleanness in linked lists. In SAS\u201900, Static Analysis Symposium. Springer, 2000.","DOI":"10.1007\/978-3-540-45099-3_7"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Ghiya and L. Hendren. Putting pointer analysis to work. In Symp. on Princ. of Prog. Lang., New York, NY, 1998. ACM Press.","DOI":"10.1145\/268946.268957"},{"key":"10_CR7","unstructured":"R. Ghiya and L.J. Hendren. Is it a tree, a dag, or a cyclic graph? In Symp. on Princ. of Prog. Lang., New York, NY, January 1996. ACM Press."},{"key":"10_CR8","volume-title":"Parallelizing Programs with Recursive Data Structures","author":"L. Hendren","year":"1990","unstructured":"L. Hendren. Parallelizing Programs with Recursive Data Structures. PhD thesis, Cornell Univ., Ithaca, NY, Jan 1990."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"L. Hendren, J. Hummel, and A. Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and the transformation of imperative programs. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 249\u2013260, June 1992.","DOI":"10.1145\/143103.143138"},{"key":"10_CR10","volume-title":"Program Flow Analysis: Theory and Applications","author":"N.D. Jones","year":"1981","unstructured":"N.D. Jones and S.S. Muchnick. Flow analysis and optimization of Lisp-like structures. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4. Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Symp. on Princ. of Prog. Lang., pages 66\u201374, New York, NY, 1982. ACM Press.","DOI":"10.1145\/582153.582161"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 21\u201334, 1988.","DOI":"10.1145\/53990.53993"},{"key":"10_CR13","unstructured":"T. Lev-Ami and M. Sagiv. TVLA: A framework for Kleene based static analysis. In SAS\u201900, Static Analysis Symposium. Springer, 2000."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"M. Sagiv","year":"1998","unstructured":"M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. Trans. on Prog. Lang. and Syst., 20(1):1\u201350, Jan 1998.","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Symp. on Princ. of Prog. Lang., 1999.","DOI":"10.1145\/292540.292552"},{"key":"10_CR16","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"M. Sharir","year":"1981","unstructured":"M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189\u2013234. Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"B. Steensgaard. Points-to analysis in almost-linear time. In Symp. on Princ. Of Prog. Lang., pages 32\u201341, 1996.","DOI":"10.1145\/237721.237727"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45306-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:19:36Z","timestamp":1556921976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45306-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418610","9783540453062"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45306-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}