{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:34:12Z","timestamp":1725536052307},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028458"},{"type":"electronic","value":"9783642028465"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02846-5_34","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T06:44:16Z","timestamp":1248072256000},"page":"417-431","source":"Crossref","is-referenced-by-count":4,"title":["Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hildebrandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo A.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","first-page":"104","volume-title":"POPL 2001 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL 2001 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 104\u2013115. ACM Press, New York (2001)"},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The SPi Calculus. Inf. Comput.\u00a0148(1), 1\u201370 (1999)","journal-title":"Inf. Comput."},{"key":"34_CR3","first-page":"82","volume-title":"14th IEEE Computer Security Foundations Workshop (CSFW-14)","author":"B. Blanchet","year":"2001","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: 14th IEEE Computer Security Foundations Workshop (CSFW-14), Cape Breton, Nova Scotia, Canada, June 2001, pp. 82\u201396. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"3","key":"34_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10207-004-0036-x","volume":"2","author":"M. Buchholtz","year":"2004","unstructured":"Buchholtz, M., Riis Nielson, H., Nielson, F.: A calculus for control flow analysis of security protocols. International Journal of Information Security\u00a02(3), 145\u2013167 (2004)","journal-title":"International Journal of Information Security"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45789-5_24","volume-title":"Static Analysis","author":"R. Corin","year":"2002","unstructured":"Corin, R., Etalle, S.: An improved constraint-based system for the verification of security protocols. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 326\u2013341. Springer, Heidelberg (2002)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Crazzolara, F., Winskel, G.: Events in security protocols. In: ACM Conference on Computer and Communications Security, pp. 96\u2013105 (2001)","DOI":"10.1145\/501983.501998"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. Technical report, Dept. of Computer Science, Stanford University, Stanford, CA, USA (1981)","DOI":"10.1109\/SFCS.1981.32"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Fiore, M., Abadi, M.: Computing symbolic models for verifying cryptographic protocols. In: Proc. 14th IEEE Computer Security Foundations Workshop, pp. 160\u2013173 (2001)","DOI":"10.1109\/CSFW.2001.930144"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/11799573_43","volume-title":"Logic Programming","author":"H.A. L\u00f3pez","year":"2006","unstructured":"L\u00f3pez, H.A., P\u00e9rez, J.A., Palamidessi, C., Rueda, C., Valencia, F.D.: A declarative framework for security: Secure concurrent constraint programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 449\u2013450. Springer, Heidelberg (2006)"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(95)00144-2","volume":"56","author":"G. Lowe","year":"1995","unstructured":"Lowe, G.: An attack on the needham-schroeder public-key authentication protocol. Inf. Process. Lett.\u00a056(3), 131\u2013133 (1995)","journal-title":"Inf. Process. Lett."},{"key":"34_CR11","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"3","volume-title":"Foundations of Computer Security (FCS)","author":"D. Miller","year":"2003","unstructured":"Miller, D.: Encryption as an abstract data type: An Extended Abstract. In: Foundations of Computer Security (FCS). Electronic Notes in Theoretical Computer Science, vol.\u00a084, pp. 3\u201315. Springer, Heidelberg (2003)"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts I and II. Journal of Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Journal of Information and Computation"},{"key":"34_CR13","volume-title":"10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming","author":"C.A. Olarte","year":"2008","unstructured":"Olarte, C.A., Valencia, F.D.: The expressivity of universal timed ccp. In: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, Valencia, Spain, July 2008. ACM Press, New York (2008)"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Olarte, C.A., Valencia, F.D.: Universal concurrent constraint programming: Symbolic semantics and applications to security. In: 23rd Annual ACM Symposium on Applied Computing (2008)","DOI":"10.1145\/1363686.1363726"},{"key":"34_CR15","first-page":"59","volume-title":"Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science","author":"C. Palamidessi","year":"2006","unstructured":"Palamidessi, C., Saraswat, V., Valencia, F., Victor, B.: On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. In: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pp. 59\u201368. IEEE Computer Society, Washington (2006)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: Proceedings, Symposium on Logic in Computer Science, 1994. LICS 1994, pp. 71\u201380 (1994)","DOI":"10.1109\/LICS.1994.316085"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02846-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:33:38Z","timestamp":1558438418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02846-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028458","9783642028465"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02846-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}