{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:05Z","timestamp":1761611165282},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_22","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:36:20Z","timestamp":1127831780000},"page":"320-335","source":"Crossref","is-referenced-by-count":30,"title":["Pair-Sharing Analysis of Object-Oriented Programs"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Secci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fausto","family":"Spoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00312-1","volume":"277","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science\u00a0277(1-2), 3\u201346 (2002)","journal-title":"Theoretical Computer Science"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Gabbrielli, M., Levi, G., Martelli, M.: The s-Semantics Approach: Theory and Applications. Journal of Logic Programming\u00a019\/20, 149\u2013197 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"8","key":"22_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-24754-8_10","volume-title":"Functional and Logic Programming","author":"F. Bueno","year":"2004","unstructured":"Bueno, F., de la Banda, M.J.G.: Set-sharing is not always redundant for pair-sharing. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 117\u2013131. Springer, Heidelberg (2004)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/158511.158639","volume-title":"Proc. of the 20th Symposium on Principles of Programming Languages (POPL)","author":"J.D. Choi","year":"1993","unstructured":"Choi, J.D., Burke, M., Carini, P.: Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects. In: Proc. of the 20th Symposium on Principles of Programming Languages (POPL), Charleston, South Carolina, pp. 232\u2013245. ACM, New York (1993)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Cortesi, A., Fil\u00e9, G.: Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis. In: Proc. of Partial Evaluation and Semantics-Based Program Manipulation (PEPM), pp. 52\u201361. Yale University, New Haven, (1991)","DOI":"10.1145\/115865.115872"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. of the 4th ACM Symposium on Principles of Programming Languages (POPL), pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"issue":"2,3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming\u00a013(2,3), 103\u2013179 (1992)","journal-title":"Journal of Logic Programming"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-49538-X_5","volume-title":"Proc. of the European Conference on Object-Oriented Programming (ECOOP)","author":"J. Dean","year":"1995","unstructured":"Dean, J., Grove, D., Chambers, C.: Optimization of Object-Oriented Programs using Static Class Hierarchy Analysis. In: Olthoff, W.G. (ed.) ECOOP 1995. LNCS, vol.\u00a0952, pp. 77\u2013101. Springer, Heidelberg (1995)"},{"issue":"2,3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"Jacobs, D., Langen, A.: Static Analysis of Logic Programs for Independent AND Parallelism. Journal of Logic Programming\u00a013(2,3), 291\u2013314 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"1-2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(00)00009-1","volume":"46","author":"A. King","year":"2000","unstructured":"King, A.: Pair-Sharing over Rational Trees. Journal of Logic Programming\u00a046(1-2), 139\u2013155 (2000)","journal-title":"Journal of Logic Programming"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/571157.571168","volume-title":"Proc. of the 4th international ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)","author":"V. Lagoon","year":"2002","unstructured":"Lagoon, V., Stuckey, P.J.: Precise Pair-Sharing Analysis of Logic Programs. In: Proc. of the 4th international ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), Pittsburgh, PA, USA, pp. 99\u2013108. ACM, New York (2002)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45337-7_5","volume-title":"ECOOP 2001 - Object-Oriented Programming","author":"I. Pollet","year":"2001","unstructured":"Pollet, I., Le Charlier, B., Cortesi, A.: Distinctness and sharing domains for static analysis of java programs. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol.\u00a02072, pp. 77\u201398. Springer, Heidelberg (2001)"},{"key":"22_CR14","unstructured":"Secci, S., Spoto, F.: Pair-Sharing Analysis of Object-Oriented Programs (2005), Available at, http:\/\/www.sci.univr.it\/~spoto\/papers.html"},{"key":"22_CR15","unstructured":"Spoto, F.: The julia Static Analyser (2004), http:\/\/www.sci.univr.it\/~spoto\/julia"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to Analysis in Almost Linear Time. In: Proc. of the 23th ACM Symposium on Principles of Programming Languages (POPL), St. Petersburg Beach, Florida, USA, January 1996, pp. 32\u201341 (1996)","DOI":"10.1145\/237721.237727"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/353171.353190","volume-title":"Proc. of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), SIGPLAN Notices","author":"F. Tip","year":"2000","unstructured":"Tip, F., Palsberg, J.: Scalable Propagation-Based Call Graph Construction Algorithms. In: Proc. of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), SIGPLAN Notices, Minneapolis, Minnesota, USA, vol.\u00a035(10), pp. 281\u2013293. ACM, New York (2000)"},{"key":"22_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages. The MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:28Z","timestamp":1605642028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11547662_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}