{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:54Z","timestamp":1725560394145},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_66","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"769-780","source":"Crossref","is-referenced-by-count":1,"title":["A BDD-Representation for the Logic of Equality and Uninterpreted Functions"],"prefix":"10.1007","author":[{"given":"Jaco","family":"van de Pol","sequence":"first","affiliation":[]},{"given":"Olga","family":"Tveretina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","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, 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"66_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-58179-0_44","volume-title":"Computer Aided Verification","author":"J. Burch","year":"1994","unstructured":"Burch, J., Dill, D.: Automated verification of pipelined microprocesoor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 68\u201380. Springer, Heidelberg (1994)"},{"key":"66_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0890-5401(02)93175-5","volume":"178","author":"A. Pnueli","year":"2002","unstructured":"Pnueli, A., Rodeh, Y., Shtrichman, O., Siegel, M.: The small model property: how small can it be? Information and Computation\u00a0178, 279\u2013293 (2002)","journal-title":"Information and Computation"},{"issue":"2","key":"66_CR4","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.: Fast decision procedures based on congruence closure. Journal of the ACM\u00a027(2), 356\u2013364 (1980)","journal-title":"Journal of the ACM"},{"key":"66_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/359545.359570","volume":"21","author":"R. Shostak","year":"1978","unstructured":"Shostak, R.: An algorithm for reasoning about equality. Communications of the ACM\u00a021, 583\u2013585 (1978)","journal-title":"Communications of the ACM"},{"key":"66_CR6","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Solvable cases of the decision problem","author":"W. Ackermann","year":"1954","unstructured":"Ackermann, W.: Solvable cases of the decision problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1954)"},{"key":"66_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0028749","volume-title":"Computer Aided Verification","author":"A. Goel","year":"1998","unstructured":"Goel, A., Sajid, K., Zhou, H., Aziz, A., Singhal, V.: BDD based procedures for a theory of equality with uninterpreted functions. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol.\u00a01427, pp. 244\u2013255. Springer, Heidelberg (1998)"},{"key":"66_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-36078-6_13","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"P. Fontaine","year":"2002","unstructured":"Fontaine, P., Gribomont, E.P.: Using BDDs with combinations of theories. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 190\u2013201. Springer, Heidelberg (2002)"},{"key":"66_CR9","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/566385.566390","volume":"3","author":"R. Bryant","year":"2002","unstructured":"Bryant, R., Velev, M.: Boolean satisfiability with transitivity constraints. ACM Transactions on Computational Logic\u00a03, 604\u2013627 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"66_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-540-24698-5_56","volume-title":"LATIN 2004: Theoretical Informatics","author":"O. Tveretina","year":"2004","unstructured":"Tveretina, O., Zantema, H.: A proof system and a decision procedure for equality logic. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 530\u2013539. Springer, Heidelberg (2004)"},{"key":"66_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-44404-1_11","volume-title":"Logic for Programming and Automated Reasoning","author":"J. Groote","year":"2000","unstructured":"Groote, J., van de Pol, J.: Equational binary decision diagrams. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 161\u2013178. Springer, Heidelberg (2000)"},{"key":"66_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.apal.2004.10.005","volume":"133\/1-3","author":"B. Badban","year":"2005","unstructured":"Badban, B., van de Pol, J.: Zero, sucessor and equality in BDDs. Annals of Pure and Applied Logic\u00a0133\/1-3, 101\u2013123 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"66_CR13","unstructured":"Badban, B., van de Pol, J.: An algorithm to verify formulas by means of (0,s,=)-BDDs. In: Proceedings of the 9th Annual Computer Society of Iran Computer Conference (CSICC 2004), Tehran, Iran (2004)"},{"key":"66_CR14","doi-asserted-by":"crossref","unstructured":"Blom, S., Groote, J., van Langevelde, I., Lisser, B., van de Pol, J.: New developments around the \u03bcCRL tool set. In: Proceedings of FMICS 2003. ENTCS, vol.\u00a080 (2003)","DOI":"10.1016\/S1571-0661(04)80827-2"},{"key":"66_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-540-28644-8_20","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J. Groote","year":"2004","unstructured":"Groote, J., Willemse, T.: Parameterised boolean equation systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 308\u2013324. Springer, Heidelberg (2004)"},{"key":"66_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"66_CR17","doi-asserted-by":"crossref","unstructured":"van de Pol, J., Tveretina, O.: A BDD-representation for the logic of equality and uninterpreted functions (a full version with proofs). Technical Report SEN-R0509, Centrum voor Wiskunde en Informatica, Amsterdam (2005)","DOI":"10.1007\/11549345_66"},{"key":"66_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-30210-0_7","volume-title":"Artificial Intelligence and Symbolic Computation","author":"O. Tveretina","year":"2004","unstructured":"Tveretina, O.: A decision procedure for equality logic with uninterpreted functions. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol.\u00a03249, pp. 66\u201379. Springer, Heidelberg (2004)"},{"key":"66_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-45657-0_50","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2002","unstructured":"Blom, S., van de Pol, J.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 596\u2013609. Springer, Heidelberg (2002)"},{"key":"66_CR20","unstructured":"van de Pol, J.: A prover for the \u03bcCRL toolset with applications \u2013 Version 0.1. Technical Report SEN-R0106, CWI, Amsterdam (2001)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:46:37Z","timestamp":1586472397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11549345_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}