{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:36:37Z","timestamp":1778297797454,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540654629","type":"print"},{"value":"9783540492535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49253-4_33","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:56:45Z","timestamp":1181185005000},"page":"471-485","source":"Crossref","is-referenced-by-count":10,"title":["Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bagnara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","volume":"31","author":"T. Armstrong","year":"1998","unstructured":"T. Armstrong, K. Marriott, P. Schachte, and H. S\u00f8ndergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(1):3\u201345, 1998.","journal-title":"Science of Computer Programming"},{"key":"33_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-61756-6_80","volume-title":"Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium","author":"R. Bagnara","year":"1996","unstructured":"R. Bagnara. A reactive implementation of Pos using ROBDDs. In H. Kuchen and S. D. Swierstra, editors, Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium, volume 1140 of Lecture Notes in Computer Science, pages 107\u2013121, Aachen, Germany, 1996. Springer-Verlag, Berlin."},{"key":"33_CR3","series-title":"PhD thesis","volume-title":"Data-Flow Analysis for Constraint Logic-Based Languages","author":"R. Bagnara","year":"1997","unstructured":"R. Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, I-56125 Pisa, Italy, March 1997. Printed as Report TD-1\/97."},{"key":"33_CR4","volume-title":"Technical Report 98\/5","author":"R. Bagnara","year":"1998","unstructured":"R. Bagnara and P. Schachte. Efficient implementation of Pos. Technical Report 98\/5, Department of Computer Science, The University of Melbourne, Australia, 1998."},{"key":"33_CR5","unstructured":"P. Bigot, S. K. Debray, and K. Marriott. Understanding finiteness analysis using abstract interpretation. In K. Apt, editor, Logic Programming: Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press Series in Logic Programming, pages 735\u2013749, Washington, USA, 1992. The MIT Press."},{"issue":"8","key":"33_CR6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"33_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. E. Bryant","year":"1992","unstructured":"R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293\u2013318, September 1992.","journal-title":"ACM Computing Surveys"},{"key":"33_CR8","volume-title":"Technical Report CS-93-13","author":"A. Cortesi","year":"1993","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Conceptual and software support for abstract domain design: Generic structural domain and open product. Technical Report CS-93-13, Brown University, Providence, RI, 1993."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combinations of abstract domains for logic programming. In Conference Record of POPL\u2019 94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 227\u2013239, Portland, Oregon, 1994.","DOI":"10.1145\/174675.177880"},{"key":"33_CR10","unstructured":"P. W. Dart. Dependency Analysis and Query Interfaces for Deductive Databases. PhD thesis, The University of Melbourne, Department of Computer Science, 1988. Printed as Technical Report 88\/35."},{"key":"33_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/3-540-60043-4_76","volume-title":"Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST\u201995)","author":"M. Falaschi","year":"1995","unstructured":"M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Conuence and concurrent constraint programming. In V. S. Alagar and M. Nivat, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST\u201995), volume 936 of Lecture Notes in Computer Science, pages 531\u2013545. Springer-Verlag, Berlin, 1995."},{"key":"33_CR12","first-page":"123","volume-title":"Abstract Interpretation of Declarative Languages","author":"N. D. Jones","year":"1987","unstructured":"N. D. Jones and H. S\u00f8ndergaard. A semantics-based framework for the abstract interpretation of Prolog. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 6, pages 123\u2013142. Ellis Horwood Ltd, West Sussex, England, 1987."},{"key":"33_CR13","unstructured":"K. Marriott and H. S\u00f8ndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conference on Logic Programming, Cleveland, Ohio, USA, 1989."},{"issue":"1","key":"33_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","volume":"2","author":"C. S. Mellish","year":"1985","unstructured":"C. S. Mellish. Some global optimizations for a Prolog compiler. Journal of Logic Programming, 2(1):43\u201366, 1985.","journal-title":"Journal of Logic Programming"},{"key":"33_CR15","unstructured":"P. Schachte. Efficient ROBDD operations for program analysis. In K. Ramamohanarao, editor, ACSC\u201996: Proceedings of the 19th Australasian Computer Science Conference, pages 347\u2013356. Australian Computer Science Communications, 1996."},{"key":"33_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-62034-6_63","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"H. S\u00f8ndergaard","year":"1996","unstructured":"H. S\u00f8ndergaard. Immediate fixpoints and their use in groundness analysis. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lecture Notes in Computer Science, pages 359\u2013370. Springer-Verlag, Berlin, 1996."},{"key":"33_CR17","unstructured":"J. Zobel. Analysis of Logic Programs. PhD thesis, The University of Melbourne, 1990."}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49253-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:20:58Z","timestamp":1550384458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49253-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654629","9783540492535"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49253-4_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}