{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T18:07:01Z","timestamp":1769105221126,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212997","type":"print"},{"value":"9783540247302","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_39","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:00:15Z","timestamp":1280746815000},"page":"530-545","source":"Crossref","is-referenced-by-count":62,"title":["Symbolically Computing Most-Precise Abstract Operations for Shape Analysis"],"prefix":"10.1007","author":[{"given":"G.","family":"Yorsh","sequence":"first","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":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44585-4_25","volume-title":"Computer Aided Verification","author":"T. Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.K.: The SLAM toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 260\u2013264. Springer, Heidelberg (2001)"},{"key":"39_CR2","first-page":"269","volume-title":"Symp. on Princ. of Prog. Lang.","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Symp. on Princ. of Prog. Lang., pp. 269\u2013282. ACM Press, New York (1979)"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.G. Henriksen","year":"1995","unstructured":"Henriksen, J.G., Jensen, J., J\u00f8rgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, Springer, Heidelberg (1995)"},{"key":"39_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)"},{"key":"39_CR5","unstructured":"Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G.: Decidable logics for expressing heap connectivity (2003) (in preparation)"},{"key":"39_CR6","series-title":"ch. 4","first-page":"102","volume-title":"Program Flow Analysis: Theory and Applications","author":"N.D. Jones","year":"1981","unstructured":"Jones, N.D., Muchnick, S.S.: Flow analysis and optimization of Lisp-like structures. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications. ch. 4, pp. 102\u2013131. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"39_CR7","volume-title":"Symp. on Princ. of Prog. Lang.","author":"N. Klarlund","year":"1993","unstructured":"Klarlund, N., Schwartzbach, M.: Graph types. In: Symp. on Princ. of Prog. Lang., January 1993, ACM Press, New York (1993)"},{"key":"39_CR8","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":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-24622-0_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"T. Reps","year":"2004","unstructured":"Reps, T., Sagiv, M., Yorsh, G.: Symbolic implementation of the best transformer. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 252\u2013266. Springer, Heidelberg (2004) (to appear)"},{"key":"39_CR10","first-page":"105","volume-title":"Symp. on Princ. of Prog. Lang.","author":"M. Sagiv","year":"1999","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: Symp. on Princ. of Prog. Lang., January 1999, pp. 105\u2013118. ACM Press, New York (1999)"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst. (2002)","DOI":"10.1145\/514188.514190"},{"key":"39_CR12","series-title":"ch. 7","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.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications. ch. 7, pp. 189\u2013234. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"39_CR13","unstructured":"Wang, E.Y.-B.: Analysis of Recursive Types in an Imperative Language. PhD thesis, Univ. of Calif., Berkeley, CA (1994)"},{"key":"39_CR14","unstructured":"Weidenbach, C.: SPASS: An automated theorem prover for first-order logic with equality, Available at http:\/\/spass.mpi-sb.mpg.de\/index.html"},{"key":"39_CR15","unstructured":"Yorsh, G.: Logical characterizations of heap abstractions. Master\u2019s thesis, Tel-Aviv University, Tel-Aviv, Israel (2003), Available at http:\/\/www.math.tau.ac.il\/~gretay"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Reps, T., Sagiv, M.: Symbolically computing most-precise abstract operations for shape analysis. Technical report, TAU (2003), Available at http:\/\/www.cs.tau.ac.il\/~gretay","DOI":"10.1007\/978-3-540-24730-2_39"}],"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_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:18:34Z","timestamp":1559344714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}