{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T14:08:00Z","timestamp":1746194880891,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540227915"},{"type":"electronic","value":"9783540278641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27864-1_19","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T16:35:37Z","timestamp":1284654937000},"page":"246-264","source":"Crossref","is-referenced-by-count":26,"title":["A Relational Approach to Interprocedural Shape Analysis"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Jeannet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Loginov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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.\u00a024, 217\u2013298 (2002)","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Reps, T., Sagiv, M., Loginov, A.: Finite differencing of logical formulas for static analysis. In: European Symp. on Programming, pp. 380\u2013398 (2003)","DOI":"10.1007\/3-540-36575-3_26"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Static Analysis Symp., pp. 280\u2013301 (2000)","DOI":"10.1007\/978-3-540-45099-3_15"},{"key":"19_CR4","first-page":"237","volume-title":"Formal Descriptions of Programming Concepts, IFIP WG 2.2","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: Neuhold, E. (ed.) Formal Descriptions of Programming Concepts, IFIP WG 2.2, St. Andrews, Canada, August 1977, pp. 237\u2013277. North-Holland, Amsterdam (1978)"},{"key":"19_CR5","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 189\u2013234. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: Comp. Construct., pp. 125\u2013140 (1992)","DOI":"10.1007\/3-540-55984-1_13"},{"key":"19_CR7","first-page":"49","volume-title":"Princ. of Prog. Lang.","author":"T. Reps","year":"1995","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Princ. of Prog. Lang., pp. 49\u201361. ACM Press, New York (1995)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M. Sagiv","year":"1996","unstructured":"Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comp. Sci.\u00a0167, 131\u2013170 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44898-5_11","volume-title":"Static Analysis","author":"T. Reps","year":"2003","unstructured":"Reps, T., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 189\u2013213. Springer, Heidelberg (2003)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.: Bebop: A path-sensitive interprocedural dataflow engine. In: Prog. Analysis for Softw. Tools and Eng., pp. 97\u2013103 (2001)","DOI":"10.1145\/379605.379690"},{"key":"19_CR11","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, pp. 133\u2013149. Springer, Heidelberg (2001)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Jones, N., Muchnick, S.: A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In: Princ. of Prog. Lang., pp. 66\u201374 (1982)","DOI":"10.1145\/582153.582161"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Deutsch, A.: On determining lifetime and aliasing of dynamically allocated data in higherorder functional specifications. In: Princ. of Prog. Lang., pp. 157\u2013168 (1990)","DOI":"10.1145\/96709.96725"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Gopan, D., DiMaio, F.: N.Dor, Reps, T., Sagiv, M.: Numeric domains with summarized dimensions. In: Tools and Algs. for the Construct. and Anal. of Syst., pp. 512\u2013529 (2004)","DOI":"10.1007\/978-3-540-24730-2_38"},{"key":"19_CR15","unstructured":"Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement for 3-valued-logic analysis. Tech. Rep. 1504, Comp. Sci. Dept., Univ. of Wisconsin (2004)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Reps, T., Sagiv, M.: Symbolically computing most-precise abstract operations for shape analysis. In: Tools and Algs. for the Construct. and Anal. of Syst., pp. 530\u2013545 (2004)","DOI":"10.1007\/978-3-540-24730-2_39"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Jeannet, B., Loginov, A., Reps, T., Sagiv, M.: A relational approach to interprocedural shape analysis. Tech. Rep. 1505, Comp. Sci. Dept., Univ. of Wisconsin (2004)","DOI":"10.1007\/978-3-540-27864-1_19"},{"key":"19_CR18","unstructured":"Yorsh, G.: Logical characterizations of heap abstractions. Master\u2019s thesis, School of Computer Science, Tel Aviv University, Israel (2003)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear constraints among variables of a program. In: Princ. of Prog. Lang., pp. 84\u201396 (1978)","DOI":"10.1145\/512760.512770"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: 8th Working Conf. on Rev. Eng., pp. 310\u2013322 (2001)","DOI":"10.1109\/WCRE.2001.957836"}],"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_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:49:03Z","timestamp":1740520143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}