{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:17:07Z","timestamp":1726409827042},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319630458"},{"type":"electronic","value":"9783319630465"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63046-5_5","type":"book-chapter","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T13:34:07Z","timestamp":1499693647000},"page":"60-76","source":"Crossref","is-referenced-by-count":5,"title":["Notions of Knowledge in Combinations of Theories Sharing Constructors"],"prefix":"10.1007","author":[{"given":"Serdar","family":"Erbatur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Marshall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Ringeissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,11]]},"reference":[{"issue":"1\u20132","key":"5_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoret. Comput. Sci. 367(1\u20132), 2\u201332 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2001, pp. 104\u2013115. ACM, New York (2001)","DOI":"10.1145\/360204.360213"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A Armando","year":"2005","unstructured":"Armando, A., et al.: The AVISPA tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281\u2013285. Springer, Heidelberg (2005). doi: 10.1007\/11513988_27"},{"key":"5_CR4","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, New York (1998)"},{"issue":"2","key":"5_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1006\/jsco.1996.0009","volume":"21","author":"F Baader","year":"1996","unstructured":"Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories: combining decision procedures. J. Symb. Comput. 21(2), 211\u2013243 (1996)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"5_CR6","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/inco.2001.3118","volume":"178","author":"F Baader","year":"2002","unstructured":"Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Inf. Comput. 178(2), 346\u2013390 (2002)","journal-title":"Inf. Comput."},{"issue":"1","key":"5_CR7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2422085.2422089","volume":"14","author":"M Baudet","year":"2013","unstructured":"Baudet, M., Cortier, V., Delaune, S.: YAPA: a generic tool for computing intruder knowledge. ACM Trans. Comput. Log. 14(1), 4 (2013)","journal-title":"ACM Trans. Comput. Log."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 11\u201313 June 2001, Cape Breton, Nova Scotia, Canada, pp. 82\u201396. IEEE Computer Society (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"issue":"4","key":"5_CR9","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/2926715","volume":"17","author":"R Chadha","year":"2016","unstructured":"Chadha, R., Cheval, V., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. ACM Trans. Comput. Log. 17(4), 23:1\u201323:32 (2016). https:\/\/hal.inria.fr","journal-title":"ACM Trans. Comput. Log."},{"issue":"2\u20134","key":"5_CR10","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.ic.2007.07.004","volume":"206","author":"Y Chevalier","year":"2008","unstructured":"Chevalier, Y., Rusinowitch, M.: Hierarchical combination of intruder theories. Inf. Comput. 206(2\u20134), 352\u2013377 (2008)","journal-title":"Inf. Comput."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-39910-0_10","volume-title":"Verification: Theory and Practice","author":"H Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Treinen, R.: Easy intruder deductions. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 225\u2013242. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-39910-0_10"},{"key":"5_CR12","unstructured":"Conchinha, B., Basin, D.A., Caleiro, C.: FAST: an efficient decision procedure for deduction and static equivalence. In: Schmidt-Schau\u00df, M. (ed.) Proceedings of RTA 2011, Novi Sad, Serbia. LIPIcs, vol. 10, pp. 11\u201320. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"issue":"4","key":"5_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10817-010-9208-8","volume":"48","author":"V Cortier","year":"2010","unstructured":"Cortier, V., Delaune, S.: Decidability and combination results for two notions of knowledge in security protocols. J. Autom. Reason. 48(4), 441\u2013487 (2010)","journal-title":"J. Autom. Reason."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-70545-1_38","volume-title":"Computer Aided Verification","author":"CJF Cremers","year":"2008","unstructured":"Cremers, C.J.F.: The scyther tool: verification, falsification, and analysis of security protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 414\u2013418. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-70545-1_38"},{"issue":"2","key":"5_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10817-010-9197-7","volume":"48","author":"\u015e Ciob\u00e2c\u0103","year":"2012","unstructured":"Ciob\u00e2c\u0103, \u015e., Delaune, S., Kremer, S.: Computing knowledge in security protocols under convergent equational theories. J. Autom. Reason. 48(2), 219\u2013262 (2012)","journal-title":"J. Autom. Reason."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols (extended abstract). In: 22nd Annual Symposium on Foundations of Computer Science, 28\u201330 October 1981, Nashville, Tennessee, USA, pp. 350\u2013357. IEEE Computer Society (1981)","DOI":"10.1109\/SFCS.1981.32"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-58156-1_19","volume-title":"Automated Deduction \u2014 CADE-12","author":"E Domenjoud","year":"1994","unstructured":"Domenjoud, E., Klay, F., Ringeissen, C.: Combination techniques for non-disjoint equational theories. In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, pp. 267\u2013281. Springer, Heidelberg (1994). doi: 10.1007\/3-540-58156-1_19"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-38574-2_17","volume-title":"Automated Deduction \u2013 CADE-24","author":"S Erbatur","year":"2013","unstructured":"Erbatur, S., Kapur, D., Marshall, A.M., Narendran, P., Ringeissen, C.: Hierarchical combination. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 249\u2013266. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38574-2_17"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03829-7_1","volume-title":"Foundations of Security Analysis and Design V","author":"S Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007\u20132009. LNCS, vol. 5705, pp. 1\u201350. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03829-7_1"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, CCS 2001, pp. 166\u2013175. ACM, New York (2001)","DOI":"10.1145\/501983.502007"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-03829-7_6","volume-title":"Foundations of Security Analysis and Design V","author":"S M\u00f6dersheim","year":"2009","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: The open-source fixed-point model checker for symbolic analysis of security protocols. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007\u20132009. LNCS, vol. 5705, pp. 166\u2013194. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03829-7_6"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"LC Paulson","year":"1998","unstructured":"Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Comput. Secur. 6, 85\u2013128 (1998)","journal-title":"Comput. Secur."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Schmidt, B., Meier, S., Cremers, C.J.F., Basin, D.A.: Automated analysis of Diffie-Hellman protocols and advanced security properties. In: Chong, S. (ed.) 25th IEEE Computer Security Foundations Symposium, CSF 2012, 25\u201327 June 2012, Cambridge, MA, USA, pp. 78\u201394. IEEE Computer Society (2012)","DOI":"10.1109\/CSF.2012.25"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0747-7171(89)80022-7","volume":"8","author":"M Schmidt-Schau\u00df","year":"1989","unstructured":"Schmidt-Schau\u00df, M.: Unification in a combination of arbitrary disjoint equational theories. J. Symb. Comput. 8, 51\u201399 (1989)","journal-title":"J. Symb. Comput."},{"issue":"3:12","key":"5_CR25","first-page":"1","volume":"6","author":"A Tiu","year":"2010","unstructured":"Tiu, A., Gor\u00e9, R., Dawson, J.E.: A proof theoretic analysis of intruder theories. Log. Methods Comput. Sci. 6(3:12), 1\u201337 (2010)","journal-title":"Log. Methods Comput. Sci."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11805618_21","volume-title":"Term Rewriting and Applications","author":"M Turuani","year":"2006","unstructured":"Turuani, M.: The CL-Atse protocol analyser. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 277\u2013286. Springer, Heidelberg (2006). doi: 10.1007\/11805618_21"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 26"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63046-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T08:26:34Z","timestamp":1569745594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63046-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319630458","9783319630465"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63046-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}