{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:49:43Z","timestamp":1725565783746},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_20","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T12:35:37Z","timestamp":1284640537000},"page":"265-279","source":"Crossref","is-referenced-by-count":31,"title":["Partially Disjunctive Heap Abstraction"],"prefix":"10.1007","author":[{"given":"Roman","family":"Manevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ganesan","family":"Ramalingam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Field","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-24622-0_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R. Bagnara","year":"2004","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 135\u2013148. Springer, Heidelberg (2004)"},{"key":"20_CR2","first-page":"296","volume-title":"Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation","author":"D. Chase","year":"1990","unstructured":"Chase, D., Wegman, M., Zadeck, F.: Analysis of pointers and structures. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pp. 296\u2013310. ACM Press, New York (1990)"},{"key":"20_CR3","first-page":"238","volume-title":"Proc. ACM Symp. on Principles of Programming Languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: Proc. ACM Symp. on Principles of Programming Languages, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: Esp: Path-sensitive program verification in polynomial time. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (January 2002)","DOI":"10.1145\/512529.512538"},{"key":"20_CR5","first-page":"230","volume-title":"Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation","author":"A. Deutsch","year":"1994","unstructured":"Deutsch, A.: Interprocedural alias analysis for pointers: Beyond k-limiting. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, May 1994, pp. 230\u2013241. ACM Press, New York (1994)"},{"issue":"1-3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-6423(97)00034-8","volume":"32","author":"R. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Ranzato, F.: Optimal domains for disjunctive abstract interpretation. Science of Computer Programming\u00a032(1-3), 177\u2013210 (1998)","journal-title":"Science of Computer Programming"},{"key":"20_CR7","first-page":"102","volume-title":"Program Flow Analysis: Theory and Applications","author":"N. Jones","year":"1981","unstructured":"Jones, N., Muchnick, S.: Flow analysis and optimization of Lisp-like structures. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, ch. 4, pp. 102\u2013131. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"20_CR8","unstructured":"Larus, J.: Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors. PhD thesis, Univ. of Calif., Berkeley, CA (May 1989)"},{"key":"20_CR9","first-page":"21","volume-title":"Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation","author":"J. Larus","year":"1988","unstructured":"Larus, J., Hilfinger, P.: Detecting conflicts between structure accesses. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pp. 21\u201334. ACM Press, New York (1988)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-45099-3_15","volume-title":"Static Analysis","author":"T. Lev-Ami","year":"2000","unstructured":"Lev-Ami, T., Sagiv, M.: TVLA: A framework for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 280\u2013301. Springer, Heidelberg (2000), Available from \n                    \n                      http:\/\/www.cs.tau.ac.il\/~tvla\/"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(73)90012-4","volume":"2","author":"G. Lindstrom","year":"1973","unstructured":"Lindstrom, G.: Scanning list structures without stacks or tag bits. Inf. Process. Lett.\u00a02(2), 47\u201351 (1973)","journal-title":"Inf. Process. Lett."},{"key":"20_CR12","first-page":"83","volume-title":"Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation","author":"G. Ramalingam","year":"2002","unstructured":"Ramalingam, G., Warshavsky, A., Field, J., Goyal, D., Sagiv, M.: Deriving specialized program analyses for certifying component-client conformance. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, June 2002, pp. 83\u201394. ACM Press, New York (2002)"},{"key":"20_CR13","unstructured":"Reps, T., Sagiv, M., Wilhelm, R.: Automatic verification of a simple mark and sweep garbabge collector. Presented in the 2001 University of Washington and Microsoft Research Summer Institute, Specifying and Checking Properties of Software (2001), \n                    \n                      http:\/\/research.microsoft.com\/specncheck\/"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"M. Sagiv","year":"1998","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACM Trans. Prog. Lang. Syst.\u00a020(1), 1\u201350 (1998)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"3","key":"20_CR15","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. ACM Transactions on Programming Languages and Systems\u00a024(3), 217\u2013298 (2002)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0890-5401(92)90076-R","volume":"101","author":"J. Stransky","year":"1992","unstructured":"Stransky, J.: A lattice for abstract interpretation of dynamic (lisp-like) structures. Information and Computation\u00a0101(1), 70\u2013102 (1992)","journal-title":"Information and Computation"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-45789-5_8","volume-title":"Static Analysis","author":"T. Yavuz-Kahveci","year":"2002","unstructured":"Yavuz-Kahveci, T., Bultan, T.: Automated verification of concurrent linked lists with counters. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 69\u201384. Springer, Heidelberg (2002)"},{"key":"20_CR18","unstructured":"Vall\u00e9e-Rai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a java optimization framework. In: Proceedings of CASCON 1999, pp. 125\u2013135 (1999)"},{"key":"20_CR19","volume-title":"Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation","author":"E. Yahav","year":"2004","unstructured":"Yahav, E., Ramalingam, G.: Verifying safety properties using separation and heterogeneous abstraction. In: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, ACM Press, New York (2004) (to Appear)"}],"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_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:31:43Z","timestamp":1619998303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}