{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:51:10Z","timestamp":1755035470827,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224379"},{"type":"electronic","value":"9783642224386"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22438-6_31","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T18:21:44Z","timestamp":1311013304000},"page":"407-421","source":"Crossref","is-referenced-by-count":7,"title":["Efficient General Unification for XOR with Homomorphism"],"prefix":"10.1007","author":[{"given":"Zhiqiang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Lynch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-55602-8_155","volume-title":"Automated Deduction - CADE-11","author":"F. Baader","year":"1992","unstructured":"Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories: Combining decision procedures. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 50\u201365. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, Voronkov (eds.) [9], pp. 445\u2013532.","key":"31_CR2","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Bevilacqua, V., Talcott, C. L. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1090\/conm\/029\/749246","volume":"29","author":"B. Brady","year":"1984","unstructured":"Brady, B., Lankford, D., Butler, G.: Abelian group unification algorithms for elementary terms. Contemporary Mathematics\u00a029, 193\u2013199 (1984)","journal-title":"Contemporary Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, Voronkov (eds.) [9], pp. 535\u2013610.","key":"31_CR5","DOI":"10.1016\/B978-044450813-3\/50011-4"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"FOSAD","author":"S. Escobar","year":"2007","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-npa: Cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD. LNCS, vol.\u00a05705, pp. 1\u201350. Springer, Heidelberg (2007)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-61511-3_90","volume-title":"CADE","author":"Q. Guo","year":"1996","unstructured":"Guo, Q., Narendran, P., Wolfram, D.A.: Unification and matching modulo nilpotence. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 261\u2013274. Springer, Heidelberg (1996)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","first-page":"135","volume-title":"ASIACRYPT","author":"C. Meadows","year":"1995","unstructured":"Meadows, C.: Formal verification of cryptographic protocols: A survey. In: Pieprzyk, J., Safavi-Naini, R. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 135\u2013150. Springer, Heidelberg (1995)"},{"volume-title":"Handbook of Automated Reasoning (in 2 volumes)","year":"2001","unstructured":"Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier, MIT Press, Amsterdam (2001)","key":"31_CR9"},{"unstructured":"Tuengerthal, M., K\u00fcsters, R., Turuani, M.: Implementing a unification algorithm for protocol analysis with xor. In: CoRR, abs\/cs\/0610014 (2006)","key":"31_CR10"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-23"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22438-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T23:19:37Z","timestamp":1560381577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22438-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224379","9783642224386"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22438-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}