{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:57Z","timestamp":1725551937723},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311393"},{"type":"electronic","value":"9783540316220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11609773_1","type":"book-chapter","created":{"date-parts":[[2005,12,12]],"date-time":"2005-12-12T02:28:57Z","timestamp":1134354537000},"page":"1-16","source":"Crossref","is-referenced-by-count":4,"title":["Closure Operators for ROBDDs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Schachte","sequence":"first","affiliation":[]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","volume":"31","author":"T. Armstrong","year":"1998","unstructured":"Armstrong, T., Marriott, K., Schachte, P., S\u00f8ndergaard, H.: Two classes of Boolean functions for dependency analysis. Science of Computer Programming\u00a031(1), 3\u201345 (1998)","journal-title":"Science of Computer Programming"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Brace, K., Rudell, R., Bryant, R.: Efficient implementation of a BDD package. In: Proc. Twenty-seventh ACM\/IEEE Design Automation Conf., pp. 40\u201345 (1990)","DOI":"10.1145\/123186.123222"},{"issue":"8","key":"1_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers\u00a0C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. Bryant","year":"1992","unstructured":"Bryant, R.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"5","key":"1_CR5","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":"1_CR6","first-page":"237","volume-title":"Formal Description of Programming Concepts","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: Neuhold, E.J. (ed.) Formal Description of Programming Concepts, pp. 237\u2013277. North-Holland, Amsterdam (1978)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/567752.567778","volume-title":"Proc. Sixth ACM Symp. Principles of Programming Languages","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proc. Sixth ACM Symp. Principles of Programming Languages, pp. 269\u2013282. ACM Press, New York (1979)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(99)00132-6","volume":"211","author":"O. Ekin","year":"2000","unstructured":"Ekin, O., Foldes, S., Hammer, P.L., Hellerstein, L.: Equational characterizations of Boolean function classes. Discrete Mathematics\u00a0211, 27\u201351 (2000)","journal-title":"Discrete Mathematics"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-36575-3_7","volume-title":"Programming Languages and Systems","author":"S. Genaim","year":"2003","unstructured":"Genaim, S., King, A.: Goal-independent suspension analysis for logic programs with dynamic scheduling. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 84\u201398. Springer, Heidelberg (2003)"},{"key":"1_CR10","unstructured":"Giacobazzi, R.: Semantic Aspects of Logic Program Analysis. PhD thesis, University of Pisa, Italy (1993)"},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/293677.293680","volume":"20","author":"R. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Scozzari, F.: A logical model for relational abstract domains. ACM Trans. Programming Languages and Systems\u00a020(5), 1067\u20131109 (1998)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/581478.581488","volume-title":"Proc. 2002 ACM SIGPLAN Int. Conf. Functional Programming","author":"K. Glynn","year":"2002","unstructured":"Glynn, K., Stuckey, P.J., Sulzmann, M., S\u00f8ndergaard, H.: Exception analysis for non-strict languages. In: Proc. 2002 ACM SIGPLAN Int. Conf. Functional Programming, pp. 98\u2013109. ACM Press, New York (2002)"},{"key":"1_CR13","volume-title":"Lectures on Boolean Algebras","author":"P.R. Halmos","year":"1963","unstructured":"Halmos, P.R.: Lectures on Boolean Algebras. Springer, Heidelberg (1963)"},{"issue":"1-3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0743-1066(00)00006-6","volume":"45","author":"A. Heaton","year":"2000","unstructured":"Heaton, A., Abo-Zaed, M., Codish, M., King, A.: A simple polynomial groundness analysis for logic programs. J. Logic Programming\u00a045(1-3), 143\u2013156 (2000)","journal-title":"J. Logic Programming"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068402001485","volume":"3","author":"J.M. Howe","year":"2003","unstructured":"Howe, J.M., King, A.: Efficient groundness analysis in Prolog. Theory and Practice of Logic Programming\u00a03(1), 95\u2013124 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-25951-0_6","volume-title":"Program Development in Computational Logic","author":"J.M. Howe","year":"2004","unstructured":"Howe, J.M., King, A., Lu, L.: Analysing logic programs by reasoning backwards. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 152\u2013188. Springer, Heidelberg (2004)"},{"issue":"1\u20134","key":"1_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Precise and efficient groundness analysis for logic programs. ACM Lett. Programming Languages and Systems\u00a02(1\u20134), 181\u2013196 (1993)","journal-title":"ACM Lett. Programming Languages and Systems"},{"key":"1_CR18","unstructured":"Mycroft, A.: Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, Scotland (1981)"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"514","DOI":"10.2307\/1968978","volume":"44","author":"O. Ore","year":"1943","unstructured":"Ore, O.: Combinations of closure relations. Ann. Math.\u00a044(3), 514\u2013533 (1943)","journal-title":"Ann. Math."},{"key":"#cr-split#-1_CR20.1","doi-asserted-by":"crossref","unstructured":"Post, E.L.: The Two-Valued Iterative Systems of Mathematical Logic. Princeton University Press, Princeton (1941);","DOI":"10.1515\/9781400882366"},{"key":"#cr-split#-1_CR20.2","unstructured":"Reprinted in Davis, M.: Solvability, Provability, Definability: The Collected Works of Emil L. Post, pp. 249\u2013374. Birkha\u00fcser (1994)"},{"key":"1_CR21","volume-title":"Boolean Functions and Equations","author":"S. Rudeanu","year":"1974","unstructured":"Rudeanu, S.: Boolean Functions and Equations. North-Holland, Amsterdam (1974)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. Tenth Ann. ACM Symp. Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.2307\/1968865","volume":"43","author":"M. Ward","year":"1942","unstructured":"Ward, M.: The closure operators of a lattice. Ann. Math.\u00a043(2), 191\u2013196 (1942)","journal-title":"Ann. Math."}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11609773_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:06:56Z","timestamp":1619492816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11609773_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540311393","9783540316220"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11609773_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}