{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:57:30Z","timestamp":1743062250907,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540897392"},{"type":"electronic","value":"9783540897408"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89740-8_4","type":"book-chapter","created":{"date-parts":[[2008,11,27]],"date-time":"2008-11-27T13:14:24Z","timestamp":1227791664000},"page":"47-63","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Set Sharing Using ZBDDs"],"prefix":"10.1007","author":[{"given":"Mario","family":"M\u00e9ndez-Lojo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Lhot\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel V.","family":"Hermenegildo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bacon, D.F., Sweeney, P.F.: Fast static analysis of C++ virtual function calls. In: Proc. of OOPSLA 1996, SIGPLAN Notices, October 1996, vol.\u00a031(10), pp. 324\u2013341 (1996)","DOI":"10.1145\/236338.236371"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/781131.781144","volume-title":"Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation","author":"M. Berndl","year":"2003","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to Analysis Using BDDs. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pp. 103\u2013114. ACM Press, New York (2003)"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Comput. Surv.\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1145\/330249.330252","volume":"21","author":"M. Codish","year":"1999","unstructured":"Codish, M., S\u00f8ndergaard, H., Stuckey, P.J.: Sharing and groundness dependencies in logic programs. ACM Transactions on Programming Languages and Systems\u00a021(5), 948\u2013976 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR5","unstructured":"Coudert, O.: Solving Graph Optimization Problems with ZBDDs (1997)"},{"key":"4_CR6","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: Fourth ACM Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-49538-X_5","volume-title":"ECOOP \u201995 - Object-Oriented Programming","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. (ed.) ECOOP 1995. LNCS, vol.\u00a0952, pp. 77\u2013101. Springer, Heidelberg (1995)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Minato, S.I.: Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems. In: DAC, pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1303-8","volume-title":"Binary Decision Diagrams and Applications for VLSICAD","author":"S.I. Minato","year":"1996","unstructured":"Minato, S.I.: Binary Decision Diagrams and Applications for VLSICAD. Kluwer, Norwell (1996)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s100090100038","volume":"3","author":"S.I. Minato","year":"2001","unstructured":"Minato, S.I.: Zero-suppressed BDDs and their Applications. STTT\u00a03(2), 156\u2013170 (2001)","journal-title":"STTT"},{"key":"4_CR11","unstructured":"Jacobs, D., Langen, A.: Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. In: North American Conference on Logic Programming (1989)"},{"key":"4_CR12","unstructured":"JProfiler, http:\/\/www.ej-technologies.com\/products\/jprofiler\/"},{"issue":"3-4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1025055424017","volume":"30","author":"X. Leroy","year":"2003","unstructured":"Leroy, X.: Java bytecode verification: algorithms and formalizations. Journal of Automated Reasoning\u00a030(3-4), 235\u2013269 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR14","unstructured":"Lhot\u00e1k, O., Curial, S., Amaral, J.N.: Using ZBDDs in Points-to Analysis. In: Proceedings of the 20th International Workshop on Languages and Compilers for Parallel Computing (2007)"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58940-9","volume-title":"Algorithms and Data Structures in VLSI Design","author":"C. Meinel","year":"1998","unstructured":"Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design. Springer, New York (1998)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-78163-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M. M\u00e9ndez-Lojo","year":"2008","unstructured":"M\u00e9ndez-Lojo, M., Hermenegildo, M.: Precise Set Sharing Analysis for Java-style Programs. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 172\u2013187. Springer, Heidelberg (2008)"},{"key":"4_CR17","first-page":"166","volume-title":"1989 North American Conference on Logic Programming","author":"K. Muthukumar","year":"1989","unstructured":"Muthukumar, K., Hermenegildo, M.: Determination of Variable Dependence Information at Compile-Time Through Abstract Interpretation. In: 1989 North American Conference on Logic Programming, pp. 166\u2013189. MIT Press, Cambridge (1989)"},{"key":"4_CR18","first-page":"49","volume-title":"1991 International Conference on Logic Programming","author":"K. Muthukumar","year":"1991","unstructured":"Muthukumar, K., Hermenegildo, M.: Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In: 1991 International Conference on Logic Programming, pp. 49\u201363. MIT Press, Cambridge (1991)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-74061-2_28","volume-title":"Static Analysis","author":"\u00c9. Payet","year":"2007","unstructured":"Payet, \u00c9., Spoto, F.: Magic-Sets Transformation for the Analysis of Java Bytecode. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 452\u2013467. Springer, Heidelberg (2007)"},{"key":"4_CR20","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package (2005), http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cuddIntro.html"},{"key":"4_CR21","unstructured":"Vahidi, A.: JDD: A Pure Java BDD Library (2008), http:\/\/javaddlib.sourceforge.net\/jdd\/index.html"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/996841.996859","volume-title":"PLDI","author":"J. Whaley","year":"2004","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: PLDI, pp. 131\u2013144. ACM, New York (2004)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0031826","volume-title":"Formal Methods in Computer-Aided Design","author":"T. Yoneda","year":"1996","unstructured":"Yoneda, T., Hatori, H., Takahara, A., Minato, S.I.: BDDs vs. Zero-Suppressed BDDs: for CTL Symbolic Model Checking of petri nets. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol.\u00a01166, pp. 435\u2013449. Springer, Heidelberg (1996)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, J.: Symbolic Pointer Analysis. In: ICCAD, pp. 150\u2013157 (2002)","DOI":"10.1145\/774572.774594"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, J., Calman, S.: Symbolic Pointer Analysis Revisited. In: PLDI, pp. 145\u2013157 (2004)","DOI":"10.1145\/996841.996860"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89740-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T14:56:29Z","timestamp":1684680989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89740-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540897392","9783540897408"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89740-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}