{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:59Z","timestamp":1725550019994},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285847"},{"type":"electronic","value":"9783540319719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547662_20","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:36:20Z","timestamp":1127831780000},"page":"284-302","source":"Crossref","is-referenced-by-count":56,"title":["Interprocedural\u00a0Shape\u00a0Analysis for\u00a0Cutpoint-Free\u00a0Programs"],"prefix":"10.1007","author":[{"given":"Noam","family":"Rinetzky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eran","family":"Yahav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Almeida, P.S.: Balloon types: Controlling sharing of state in data types. In: European Conference on Object-Oriented Programming, ESOP (1997)","DOI":"10.1007\/BFb0053373"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: Bebop: A path-sensitive interprocedural dataflow engine. In: Workshop on Program Analysis for Software Tools and Engineering, PASTE (2001)","DOI":"10.1145\/379605.379690"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Naumann, D.A.: Representation independence, confinement, and access control. In: Symp. on Princ. of Prog. Lang. POPL (2002)","DOI":"10.1145\/503272.503289"},{"key":"20_CR4","unstructured":"Bokowski, B., Vitek, J.: Confined types. In: Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA (1999)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Boyapati, C., Liskov, B., Shrira, L.: Ownership types for object encapsulation. In: Symp. on Princ. of Prog. Lang. POPL (2003)","DOI":"10.1145\/604131.604156"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Chase, D.R., Wegman, M., Zadeck, F.: Analysis of pointers and structures. In: Conf. on Prog. Lang. Design and Impl. PLDI (1990)","DOI":"10.1145\/93542.93585"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/3-540-44898-5_26","volume-title":"Static Analysis","author":"S. Chong","year":"2003","unstructured":"Chong, S., Rugina, R.: Static analysis of accessed regions in recursive data structures. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, p. 1075. Springer, Heidelberg (2003)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, D., Noble, J., Potter, J.: Simple ownership types for object containment. In: European Conference on Object-Oriented Programming, ESOP (2001)","DOI":"10.1007\/3-540-45337-7_4"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, D.G., Potter, J.M., Noble, J.: Ownership types for flexible alias protection. In: Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA (1998)","DOI":"10.1145\/286936.286947"},{"key":"20_CR10","first-page":"237","volume-title":"Formal Descriptions of Programming Concepts, IFIP WG 2.2, St. Andrews, Canada, August 1977","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: Neuhold, E.J. (ed.) Formal Descriptions of Programming Concepts, IFIP WG 2.2, St. Andrews, Canada, August 1977, pp. 237\u2013277. North-Holland, Amsterdam (1978)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: Conf. on Prog. Lang. Design and Impl., PLDI (2002)","DOI":"10.1145\/512529.512538"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: Conf. on Prog. Lang. Design and Impl., PLDI (1994)","DOI":"10.1145\/178243.178263"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-45099-3_7","volume-title":"Static Analysis","author":"N. Dor","year":"2000","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: Checking cleanness in linked lists. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 115\u2013135. Springer, Heidelberg (2000)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Grothoff, C., Palsberg, J., Vitek, J.: Encapsulating objects with confined types. In: Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA (2001)","DOI":"10.1145\/504282.504300"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Hackett, B., Rugina, R.: Region-based shape analysis with tracked locations. In: Symp. on Princ. of Prog. Lang, POPL (2005)","DOI":"10.1145\/1040305.1040331"},{"issue":"7","key":"20_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 64: Quicksort. Comm. of the ACM (CACM)\u00a04(7), 321 (1961)","journal-title":"Comm. of the ACM (CACM)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Hogg, J.: Islands: Aliasing protection in object-oriented languages. In: Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA (1991)","DOI":"10.1145\/117954.117975"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: Symp. on Princ. of Prog. Lang, POPL (2001)","DOI":"10.1145\/360204.375719"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-27864-1_19","volume-title":"Static Analysis","author":"B. Jeannet","year":"2004","unstructured":"Jeannet, B., Loginov, A., Reps, T., Sagiv, M.: A relational approach to interprocedural shape analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 246\u2013264. Springer, Heidelberg (2004)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-55984-1_13","volume-title":"Compiler Construction","author":"J. Knoop","year":"1992","unstructured":"Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: Pfahler, P., Kastens, U. (eds.) CC 1992. LNCS, vol.\u00a0641, pp. 125\u2013140. Springer, Heidelberg (1992)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Leino, K.R.M., Poetzsch-Heffter, A., Zhou, Y.: Using data groups to specify and check side effects. In: Conf. on Prog. Lang. Design and Impl, PLDI (2002)","DOI":"10.1145\/512529.512559"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Reps, T., Sagiv, M., Wilhelm, R.: Putting static analysis to work for verification: A case study. In: Int. Symp. on Software Testing and Analysis, ISSTA (2000)","DOI":"10.1145\/347324.348031"},{"key":"20_CR23","unstructured":"Lev-Ami, T., Sagiv, M.: TVLA: A framework for Kleene based static analysis. In: Palsberg, J. (ed.) SAS, LNCS, vol.\u00a01824, pp. 280\u2013302. Springer, Heidelberg (2000), Available at, http:\/\/www.math.tau.ac.il\/~tvla"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-27864-1_20","volume-title":"Static Analysis","author":"R. Manevich","year":"2004","unstructured":"Manevich, R., Sagiv, M., Ramalingam, G., Field, J.: Partially disjunctive heap abstraction. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 265\u2013279. Springer, Heidelberg (2004)"},{"key":"20_CR25","unstructured":"M\u00fcller, P., Poetzsch-Heffter, A.: Universes: A type system for alias and dependency control. Technical Report 279, Fernuniversit\u00e4t Hagen (2001)"},{"key":"20_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"20_CR27","unstructured":"Noble, J., Biddle, R., Tempero, E., Potanin, A., Clarke, D.: Towards a model of encapsulation. In: The First International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming, IWACO (2003)"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Noble, J., Vitek, J., Potter, J.: Flexible alias protection. In: European Conference on Object-Oriented Programming, ESOP (1998)","DOI":"10.1007\/BFb0054091"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Symp. on Princ. of Prog. Lang, POPL (1995)","DOI":"10.1145\/199448.199462"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-36575-3_26","volume-title":"Programming Languages and Systems","author":"T. Reps","year":"2003","unstructured":"Reps, T., Sagiv, M., Loginov, A.: Finite differencing of logical formulas for static analysis. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 380\u2013398. Springer, Heidelberg (2003)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: Symp. on Logic in Computer Science, LICS (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., Wilhelm, R.: A\u00a0semantics for procedure local heaps and its abstractions. Tech. Rep.\u00a01, AVACS, (September 2004), Available at, http:\/\/www.avacs.org","DOI":"10.1145\/1047659.1040330"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., Wilhelm, R.: A\u00a0semantics for procedure local heaps and its abstractions. In: Symp. on Princ. of Prog. Lang., POPL (2005)","DOI":"10.1145\/1040305.1040330"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45306-7_10","volume-title":"Compiler Construction","author":"N. Rinetzky","year":"2001","unstructured":"Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, p. 133. Springer, Heidelberg (2001)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Sagiv, M., Yahav, E.: Interprocedural shape analysis for cutpoint-free programs. Tech. Rep. 104\/05, Tel Aviv Uni. (April 2005), Available at, http:\/\/www.math.tau.ac.il\/~maon","DOI":"10.1007\/11547662_20"},{"issue":"3","key":"20_CR36","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst (TOPLAS) 24(3), 217\u2013298 (2002)","journal-title":"Trans. on Prog. Lang. and Syst (TOPLAS)"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-44898-5_27","volume-title":"Static Analysis","author":"R. Shaham","year":"2003","unstructured":"Shaham, R., Yahav, E., Kolodner, E.K., Sagiv, M.: Establishing local temporal heap safety properties with applications to compile-time memory management. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 264\u2013289. Springer, Heidelberg (2003)"},{"key":"20_CR38","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, ch. 7, pp. 189\u2013234. Prentice-Hall, Englewood Cliffs (1981)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:27Z","timestamp":1605642027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/11547662_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}