{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:32:51Z","timestamp":1774369971841,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540330561","type":"print"},{"value":"9783540330578","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11691372_7","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T09:22:26Z","timestamp":1143537746000},"page":"105-119","source":"Crossref","is-referenced-by-count":7,"title":["Widening ROBDDs with Prime Implicants"],"prefix":"10.1007","author":[{"given":"Neil","family":"Kettle","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]},{"given":"Tadeusz","family":"Strzemecki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-49253-4_33","volume-title":"Algebraic Methodology and Software Technology","author":"R. Bagnara","year":"1998","unstructured":"Bagnara, R., Schachte, P.: Factorizing Equivalent Variable Pairs in ROBDDBased Implementations of Pos. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol.\u00a01548, pp. 471\u2013485. Springer, Heidelberg (1998)"},{"issue":"8","key":"7_CR2","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"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"R.E. Bryant","year":"1991","unstructured":"Bryant, R.E.: On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication. IEEE Transactions on Computers\u00a040(2), 205\u2013213 (1991)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 States and Beyond. Information and Compututation\u00a098(2), 142\u2013170 (1992)","journal-title":"Information and Compututation"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0012-365X(78)90168-1","volume":"24","author":"A.K. Chandra","year":"1978","unstructured":"Chandra, A.K., Markowsky, G.: On The Number of Prime Implicants. Discrete Mathematics\u00a024(1), 7\u201311 (1978)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0743-1066(99)00014-X","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M.: Worst-Case Groundness Analysis using Positive Boolean Functions. Journal of Logic Programming\u00a041(1), 125\u2013128 (1999)","journal-title":"Journal of Logic Programming"},{"key":"7_CR7","unstructured":"Coudert, O.: Two Open Questions On ROBDDs and Prime Implicants, http:\/\/www.informatik.uni-trier.de\/DesignandTest\/abstract30.html"},{"key":"7_CR8","first-page":"36","volume-title":"Proceedings of the Design Automation Conference","author":"O. Coudert","year":"1992","unstructured":"Coudert, O., Madre, J.C.: Implicit and Incremental Computation of Primes and Essential Primes of Boolean Functions. In: Proceedings of the Design Automation Conference, pp. 36\u201339. IEEE, Los Alamitos (1992)"},{"key":"7_CR9","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: Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"7_CR10","unstructured":"Crama, Y., Hammer, P.L.: Boolean Functions (to appear)"},{"key":"7_CR11","unstructured":"Fecht, C.: Abstrakte Interpretation logischer Programme: Theorie, Implementierung, Generierung. PhD thesis, Universit\u00e4t des Saarlandes (1997)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11562931_22","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2005","unstructured":"Gallagher, J.P., Henriksen, K.S., Banda, G.: Techniques for Scaling Up Analyses Based on Pre-interpretations. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 280\u2013296. Springer, Heidelberg (2005)"},{"key":"7_CR13","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. Journal of Logic Programming\u00a045, 143\u2013156 (2000)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(71)90006-9","volume":"1","author":"D.J. Kleitman","year":"1971","unstructured":"Kleitman, D.J., Edelberg, M., Lubell, D.: Maximal Sized Antichains in Partial Orders. Discrete Mathematics\u00a01(1), 47\u201353 (1971)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-6423(96)00042-1","volume":"31","author":"L. Mauborgne","year":"1998","unstructured":"Mauborgne, L.: Abstract Interpretation Using Typed Decision Graphs. Science of Computer Programming\u00a031(1), 91\u2013112 (1998)","journal-title":"Science of Computer Programming"},{"key":"7_CR16","first-page":"153","volume":"5","author":"G. Plotkin","year":"1970","unstructured":"Plotkin, G.: A Note on Inductive Generalisation. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Quine, W.V.: The Problem of Simplifying Truth Functions. American Mathematical Monthly\u00a0(52), 521\u2013531 (1952)","DOI":"10.1080\/00029890.1952.11988183"},{"key":"7_CR18","first-page":"445","volume-title":"Proceedings of the Design Automation Conference","author":"K. Ravi","year":"1998","unstructured":"Ravi, K., McMillan, K.L., Shiple, T.R., Somenzi, F.: Approximation and Decomposition of Binary Decision Diagrams. In: Proceedings of the Design Automation Conference, pp. 445\u2013450. IEEE, Los Alamitos (1998)"},{"key":"7_CR19","first-page":"42","volume-title":"International Conference on Computer Aided Design","author":"R. Rudell","year":"1993","unstructured":"Rudell, R.: Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In: International Conference on Computer Aided Design, pp. 42\u201347. IEEE, Los Alamitos (1993)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11609773_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Schachte","year":"2005","unstructured":"Schachte, P., S\u00f8ndergaard, H.: Closure Operators for ROBDDs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"7_CR21","unstructured":"Shiple, T.R.: Formal Analysis of Synchronous Circuits. PhD thesis, University of California at Berkeley, Electronics Research Laboratory (1996)"},{"key":"7_CR22","unstructured":"Somenzi, F.: CUDD Package, Release 2.4.1., http:\/\/vlsi.colorado.edu\/~fabio\/"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0885-064X(92)90033-8","volume":"8","author":"T. Strzemecki","year":"1992","unstructured":"Strzemecki, T.: Polynomial-time Algorithms for Generation of Prime Implicants. ACM Journal of Complexity\u00a08(1), 37\u201363 (1992)","journal-title":"ACM Journal of Complexity"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/3-540-48523-6_65","volume-title":"Automata, Languages and Programming","author":"C. Umans","year":"1999","unstructured":"Umans, C.: On the Complexity and Inapproximability of Shortest Implicant Problems. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 687\u2013696. Springer, Heidelberg (1999)"},{"key":"7_CR25","first-page":"131","volume-title":"Programming Language Design and Implementation","author":"J. Whaley","year":"2004","unstructured":"Whaley, J., Lam, M.S.: Cloning-Based Context-Sensitive Pointer Alias Analysis Using Binary Decision Diagrams. In: Programming Language Design and Implementation, pp. 131\u2013144. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11691372_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T13:19:38Z","timestamp":1555507178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11691372_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330561","9783540330578"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11691372_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}