{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:22Z","timestamp":1761597022798},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_56","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"609-618","source":"Crossref","is-referenced-by-count":3,"title":["Binary Decision Diagrams by Shared Rewriting"],"prefix":"10.1007","author":[{"given":"Jaco","family":"van de Pol","sequence":"first","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, H. R., AND Hulgaard, H. Boolean expression diagrams. In Twelfth Annual IEEE Symposium on Logic in Computer Science (Warsaw, Poland, 1997), IEEE Computer Society, pp. 88\u201398.","DOI":"10.1109\/LICS.1997.614938"},{"issue":"8","key":"56_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"Bryant, R. E. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35, 8 (1986), 677\u2013691.","journal-title":"IEEE Transactions on Computers"},{"key":"56_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. A CM Computing Surveys 24, 3 (1992), 293\u2013318.","journal-title":"A CM Computing Surveys"},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/43.275352","volume":"13","author":"J. Burch","year":"1994","unstructured":"Burch, J., Clarke, E., Long, D., McMillan, K., AND Dill, D. Symbolic model checking for sequential circuit verification. IEEE Trans. Computer Aided Design 13, 4 (1994), 401\u2013424.","journal-title":"IEEE Trans. Computer Aided Design"},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. Clarke","year":"1986","unstructured":"Clarke, E., Emerson, E., AND Sistla, A. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8, 2 (1986), 244\u2013263.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"56_CR6","unstructured":"Groote, J., AND VAN DE Pol, J. Equational binary decision diagrams. Tech. rep. SEN-R0006, CWI, Amsterdam, 2000. Available via http:\/\/www.cwi.nl\/~vdpol\/papers\/eqbdds.ps.Z ."},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Klop, J. W. Term rewriting systems. In Handbook of Logic in Computer Science, D. G. S. Abramski and T. Maibaum, Eds., vol. 2. Oxford University Press, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Meinel, C., AND Theobald, T. Algorithms and Data Structures in VLSI Design: OBDD-Foundations and Applications. Springer, 1998.","DOI":"10.1007\/978-3-642-58940-9"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"M\u00f8ller, J., Lichtenberg, J., Andersen, H. R., AND Hulgaard, H. Difference decision diagrams. In Computer Science Logic (Denmark, Sept. 1999).","DOI":"10.1007\/3-540-48168-0_9"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Plump, D. Term graph rewriting. In Handbook of Graph Grammars and Computing by Graph Transformation, volume 2: Applications, Languages (1999), H.-J. K. H. Ehrig, G. Engels and G. Rozenberg, Eds., World Scientific, pp. 3\u201361.","DOI":"10.1142\/9789812815149_0001"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"VAN DE Pol, J. C., AND Zantema, H. Binary decision diagrams by shared rewriting. Tech. Rep. UU-CS-2000-06, Utrecht University, 2000. Also published as CWI report SEN-R0001, Amsterdam. Available via http:\/\/www.cs.uu.nl\/docs\/research\/publication\/TechRep.html .","DOI":"10.1007\/3-540-44612-5_56"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T03:36:10Z","timestamp":1707881770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}