{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T13:23:58Z","timestamp":1720013038798},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2005,1]]},"abstract":"We study and further develop two language-based techniques for analyzing security protocols. One is based on a typed process calculus; the other, on untyped logic programs. Both focus on secrecy properties. We contribute to these two techniques, in particular by extending the former with a flexible, generic treatment of many cryptographic operations. We also establish an equivalence between the two techniques.<\/jats:p>","DOI":"10.1145\/1044731.1044735","type":"journal-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:30:55Z","timestamp":1123057855000},"page":"102-146","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Analyzing security protocols with secrecy types and logic programs"],"prefix":"10.1145","volume":"52","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA"}]},{"given":"Bruno","family":"Blanchet","sequence":"additional","affiliation":[{"name":"CNRS, \u00c9cole Normale Sup\u00e9rieure, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2005,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324266"},{"key":"e_1_2_1_2_1","volume-title":"Foundations of Secure Computation","author":"Abadi M.","unstructured":"Abadi , M. 2000. Security protocols and their properties . In Foundations of Secure Computation , F. Bauer and R. Steinbrueggen, Eds. NATO Science Series. IOS Press , Amsterdam, The Netherlands, 39--60. (Volume for the 20th International Summer School on Foundations of Secure Computation, held in Marktoberdorf, Germany (1999).)]] Abadi, M. 2000. Security protocols and their properties. In Foundations of Secure Computation, F. Bauer and R. Steinbrueggen, Eds. NATO Science Series. IOS Press, Amsterdam, The Netherlands, 39--60. (Volume for the 20th International Summer School on Foundations of Secure Computation, held in Marktoberdorf, Germany (1999).)]]"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292555"},{"key":"e_1_2_1_4_1","volume-title":"10th International Symposium (SAS'03)","volume":"2694","author":"Abadi M.","unstructured":"Abadi , M. , and Blanchet , B . 2003a. Computer-assisted verification of a protocol for certified email. In Static Analysis , 10th International Symposium (SAS'03) (San Diego, Calif.), R. Cousot, Ed. Lecture Notes in Computer Science , vol. 2694 . Springer-Verlag, Berlin, Germany, 316--335.]] Abadi, M., and Blanchet, B. 2003a. Computer-assisted verification of a protocol for certified email. In Static Analysis, 10th International Symposium (SAS'03) (San Diego, Calif.), R. Cousot, Ed. Lecture Notes in Computer Science, vol. 2694. Springer-Verlag, Berlin, Germany, 316--335.]]"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00863-0"},{"key":"e_1_2_1_6_1","volume-title":"Programming Languages and Systems: 13th European Symposium on Programming (ESOP 2004)","volume":"2986","author":"Abadi M.","unstructured":"Abadi , M. , Blanchet , B. , and Fournet , C . 2004. Just fast keying in the pi calculus . In Programming Languages and Systems: 13th European Symposium on Programming (ESOP 2004) (Barcelona, Spain), D. Schmidt, Ed. Lecture Notes in Computer Science , vol. 2986 . Springer-Verlag, Berlin, Germany, 340--354.]] Abadi, M., Blanchet, B., and Fournet, C. 2004. Just fast keying in the pi calculus. In Programming Languages and Systems: 13th European Symposium on Programming (ESOP 2004) (Barcelona, Spain), D. Schmidt, Ed. Lecture Notes in Computer Science, vol. 2986. Springer-Verlag, Berlin, Germany, 340--354.]]"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511497"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2740"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586118"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646735.701631"},{"key":"e_1_2_1_12_1","first-page":"353","article-title":"Equational reasoning in saturation-based theorem proving. In Automated Deduction---A Basis for Applications, W. Bibel and P. Schmitt, Eds. Vol. I. Kluwer, Dordrecht, The Netherlands","volume":"11","author":"Bachmair L.","year":"1998","unstructured":"Bachmair , L. , and Ganzinger , H. 1998 . Equational reasoning in saturation-based theorem proving. In Automated Deduction---A Basis for Applications, W. Bibel and P. Schmitt, Eds. Vol. I. Kluwer, Dordrecht, The Netherlands , Chapter 11 , 353 -- 397 .]] Bachmair, L., and Ganzinger, H. 1998. Equational reasoning in saturation-based theorem proving. In Automated Deduction---A Basis for Applications, W. Bibel and P. Schmitt, Eds. Vol. I. Kluwer, Dordrecht, The Netherlands, Chapter 11, 353--397.]]","journal-title":"Chapter"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/872752.873511"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647171.716095"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301317"},{"key":"e_1_2_1_16_1","volume-title":"6th International Conference. (FoSSaCS'03)","volume":"2620","author":"Blanchet B.","unstructured":"Blanchet , B. , and Podelski , A . 2003. Verification of cryptographic protocols: Tagging enforces termination. Foundations of Software Science and Computation Structures , 6th International Conference. (FoSSaCS'03) (Warsaw, Poland). A. Gordon, Ed. Lecture Notes in Computer Science , vol. 2620 . Springer-Verlag, Berlin, Germany, 136--152.]] Blanchet, B., and Podelski, A. 2003. Verification of cryptographic protocols: Tagging enforces termination. Foundations of Software Science and Computation Structures, 6th International Conference. (FoSSaCS'03) (Warsaw, Poland). A. Gordon, Ed. Lecture Notes in Computer Science, vol. 2620. Springer-Verlag, Berlin, Germany, 136--152.]]"},{"key":"e_1_2_1_18_1","volume-title":"CONCUR'98: Concurrency Theory, 9th International Conference. Lecture Notes in Computer Science","volume":"1466","author":"Bodei C.","unstructured":"Bodei , C. , Degano , P. , Nielson , F. , and Nielson , H . 1998. Control flow analysis for the π-calculus . CONCUR'98: Concurrency Theory, 9th International Conference. Lecture Notes in Computer Science , vol. 1466 . Springer Verlag, Berlin, Germany, 84--98.]] Bodei, C., Degano, P., Nielson, F., and Nielson, H. 1998. Control flow analysis for the π-calculus. CONCUR'98: Concurrency Theory, 9th International Conference. Lecture Notes in Computer Science, vol. 1466. Springer Verlag, Berlin, Germany, 84--98.]]"},{"key":"e_1_2_1_19_1","first-page":"2208","article-title":"Type systems. In The Computer Science and Engineering Handbook, A. B. Tucker, Ed. CRC Press, Boca Raton, Fla","volume":"103","author":"Cardelli L.","year":"1997","unstructured":"Cardelli , L. 1997 . Type systems. In The Computer Science and Engineering Handbook, A. B. Tucker, Ed. CRC Press, Boca Raton, Fla . Chap. 103 , 2208 -- 2236 .]] Cardelli, L. 1997. Type systems. In The Computer Science and Engineering Handbook, A. B. Tucker, Ed. CRC Press, Boca Raton, Fla. Chap. 103, 2208--2236.]]","journal-title":"Chap."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646735.701632"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW'99)","author":"Cervesato I.","unstructured":"Cervesato , I. , Durgin , N. A. , Lincoln , P. D. , Mitchell , J. C. , and Scedrov , A . 1999. A meta-notation for protocol analysis . In Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW'99) . IEEE Computer Society, Los Alamitos, Calif., 55--69.]] Cervesato, I., Durgin, N. A., Lincoln, P. D., Mitchell, J. C., and Scedrov, A. 1999. A meta-notation for protocol analysis. In Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW'99). IEEE Computer Society, Los Alamitos, Calif., 55--69.]]"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 14th International Conference Rewriting Techniques and Applications (RTA'2003)","volume":"2706","author":"Comon-Lundh H.","unstructured":"Comon-Lundh , H. , and Cortier , V . 2003. New decidability results for fragments of first-order logic and application to cryptographic protocols . In Proceedings of the 14th International Conference Rewriting Techniques and Applications (RTA'2003) (Valencia, Spain), R. Nieuwenhuis, Ed. Lecture Notes in Computer Science , vol. 2706 . Springer-Verlag, Berlin, Germany, 148--164.]] Comon-Lundh, H., and Cortier, V. 2003. New decidability results for fragments of first-order logic and application to cryptographic protocols. In Proceedings of the 14th International Conference Rewriting Techniques and Applications (RTA'2003) (Valencia, Spain), R. Nieuwenhuis, Ed. Lecture Notes in Computer Science, vol. 2706. Springer-Verlag, Berlin, Germany, 148--164.]]"},{"key":"e_1_2_1_23_1","volume-title":"26th International Colloquium, ICALP'99 (Prague, Czech Republic), J. Wiedermann, P. van Emde Boas, and M. Nielsen, Eds. Lecture Notes in Computer Science","volume":"1644","author":"Compton K. J.","unstructured":"Compton , K. J. , and Dexter , S . 1999. Proof techniques for cryptographic protocols. In Automata, Languages and Programming , 26th International Colloquium, ICALP'99 (Prague, Czech Republic), J. Wiedermann, P. van Emde Boas, and M. Nielsen, Eds. Lecture Notes in Computer Science , vol. 1644 . Springer-Verlag, Berlin, Germany, 25--39.]] Compton, K. J., and Dexter, S. 1999. Proof techniques for cryptographic protocols. In Automata, Languages and Programming, 26th International Colloquium, ICALP'99 (Prague, Czech Republic), J. Wiedermann, P. van Emde Boas, and M. Nielsen, Eds. Lecture Notes in Computer Science, vol. 1644. Springer-Verlag, Berlin, Germany, 25--39.]]"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1998.649220"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the DIMACS Workshop on Design and Formal Verification of Security Protocols","author":"Debbabi M.","unstructured":"Debbabi , M. , Mejri , M. , Tawbi , N. , and Yahmadi , I . 1997. A new algorithm for the automatic verification of authentication protocols: From specifications to flaws and attack scenarios . In Proceedings of the DIMACS Workshop on Design and Formal Verification of Security Protocols . Rutgers University, New Jersey.]] Debbabi, M., Mejri, M., Tawbi, N., and Yahmadi, I. 1997. A new algorithm for the automatic verification of authentication protocols: From specifications to flaws and attack scenarios. In Proceedings of the DIMACS Workshop on Design and Formal Verification of Security Protocols. Rutgers University, New Jersey.]]"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of Workshop on Formal Methods and Security Protocols","author":"Denker G.","unstructured":"Denker , G. , Meseguer , J. , and Talcott , C . 1998. Protocol specification and analysis in Maude . In Proceedings of Workshop on Formal Methods and Security Protocols ( Indianapolis, Indiana), N. Heintze and J. Wing, Eds.]] Denker, G., Meseguer, J., and Talcott, C. 1998. Protocol specification and analysis in Maude. In Proceedings of Workshop on Formal Methods and Security Protocols (Indianapolis, Indiana), N. Heintze and J. Wing, Eds.]]"},{"key":"e_1_2_1_27_1","volume-title":"Cryptography and Data Security","author":"Denning D. E.","unstructured":"Denning , D. E. 1982. Cryptography and Data Security . Addison-Wesley , Reading, Mass .]] Denning, D. E. 1982. Cryptography and Data Security. Addison-Wesley, Reading, Mass.]]"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW'99)","author":"Durante A.","unstructured":"Durante , A. , Focardi , R. , and Gorrieri , R . 1999. CVS: A compiler for the analysis of cryptographic protocols . In Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW'99) . IEEE Computer Society, Los Alamitos, Calif., 203--212.]] Durante, A., Focardi, R., and Gorrieri, R. 1999. CVS: A compiler for the analysis of cryptographic protocols. In Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW'99). IEEE Computer Society, Los Alamitos, Calif., 203--212.]]"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14)","author":"Durgin N.","unstructured":"Durgin , N. , Mitchell , J. , and Pavlovic , D . 2001. A compositional logic for protocol correctness . In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14) . IEEE Computer Society, Los Alamitos, Calif., 241--255.]] Durgin, N., Mitchell, J., and Pavlovic, D. 2001. A compositional logic for protocol correctness. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14). IEEE Computer Society, Los Alamitos, Calif., 241--255.]]"},{"key":"e_1_2_1_30_1","unstructured":"Durgin N. A. and Mitchell J. C. 1999. Analysis of security protocols. In Calculational System Design M. Broy and R. Steinbruggen Eds. IOS Press Amsterdam The Netherlands 369--395.]] Durgin N. A. and Mitchell J. C. 1999. Analysis of security protocols. In Calculational System Design M. Broy and R. Steinbruggen Eds. IOS Press Amsterdam The Netherlands 369--395.]]"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.629493"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14)","author":"Gordon A.","unstructured":"Gordon , A. , and Jeffrey , A . 2001. Authenticity by typing for security protocols . In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14) . IEEE Computer Society, Los Alamitos, Calif., 145--159.]] Gordon, A., and Jeffrey, A. 2001. Authenticity by typing for security protocols. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14). IEEE Computer Society, Los Alamitos, Calif., 145--159.]]"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15)","author":"Gordon A.","unstructured":"Gordon , A. , and Jeffrey , A . 2002. Types and effects for asymmetric cryptographic protocols . In Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15) . IEEE Computer Society, Los Alamitos, Calif., 77--91.]] Gordon, A., and Jeffrey, A. 2002. Types and effects for asymmetric cryptographic protocols. In Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15). IEEE Computer Society, Los Alamitos, Calif., 77--91.]]"},{"key":"e_1_2_1_34_1","unstructured":"Goubault-Larrecq J. 2002. Protocoles cryptographiques: la logique \u00e0 la rescousse! In Atelier SEcurit\u00e9 des Communications sur Internet (SECI'02) (Tunis Tunisie).]] Goubault-Larrecq J. 2002. Protocoles cryptographiques: la logique \u00e0 la rescousse! In Atelier SEcurit\u00e9 des Communications sur Internet (SECI'02) (Tunis Tunisie).]]"},{"key":"e_1_2_1_35_1","volume-title":"Une fois qu'on n'a pas trouv\u00e9 de preuve, comment le faire comprendre \u00e0 un assistant de preuve ? In Actes 15\u00e8mes journ\u00e9es francophones sur les langages applicatifs (JFLA'04) (Sainte-Marie-de-R\u00e9","author":"Goubault-Larrecq J.","unstructured":"Goubault-Larrecq , J. 2004. Une fois qu'on n'a pas trouv\u00e9 de preuve, comment le faire comprendre \u00e0 un assistant de preuve ? In Actes 15\u00e8mes journ\u00e9es francophones sur les langages applicatifs (JFLA'04) (Sainte-Marie-de-R\u00e9 , France). INRIA , Rocquencourt, France .]] Goubault-Larrecq, J. 2004. Une fois qu'on n'a pas trouv\u00e9 de preuve, comment le faire comprendre \u00e0 un assistant de preuve ? In Actes 15\u00e8mes journ\u00e9es francophones sur les langages applicatifs (JFLA'04) (Sainte-Marie-de-R\u00e9, France). INRIA, Rocquencourt, France.]]"},{"key":"e_1_2_1_36_1","volume-title":"AC: How to verify Diffie-Hellman-like protocols automatically. J. Logic Algeb. Prog. To appear.]]","author":"Goubault-Larrecq J.","year":"2005","unstructured":"Goubault-Larrecq , J. , Roger , M. , and Verma , K. N . 2005 . Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Logic Algeb. Prog. To appear.]] Goubault-Larrecq, J., Roger, M., and Verma, K. N. 2005. Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Logic Algeb. Prog. To appear.]]"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268976"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Springer-Verlag","author":"Hennessy M.","unstructured":"Hennessy , M. , and Riely , J . 2000. Information flow vs. resource access in the asynchronous pi-calculus . In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Springer-Verlag , Berlin, Germany, 415--427.]] Hennessy, M., and Riely, J. 2000. Information flow vs. resource access in the asynchronous pi-calculus. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 415--427.]]"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/645394.651914"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00197942"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/525423.830460"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288117"},{"key":"e_1_2_1_43_1","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Lowe G.","unstructured":"Lowe , G. 1996. Breaking and fixing the Needham-Schroeder public-key protocol using FDR . In Tools and Algorithms for the Construction and Analysis of Systems . Lecture Notes in Computer Science , vol. 1055 . Springer Verlag , Berlin, Germany , 147--166.]] Lowe, G. 1996. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 1055. Springer Verlag, Berlin, Germany, 147--166.]]"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/794197.795087"},{"key":"e_1_2_1_45_1","volume-title":"Workshop on Issues in the Theory of Security (WITS'02)","author":"Meadows C.","unstructured":"Meadows , C. , and Narendran , P . 2002. A unification algorithm for the group Diffie-Hellman protocol . In Workshop on Issues in the Theory of Security (WITS'02) (Portland, Ore.).]] Meadows, C., and Narendran, P. 2002. A unification algorithm for the group Diffie-Hellman protocol. In Workshop on Issues in the Theory of Security (WITS'02) (Portland, Ore.).]]"},{"key":"e_1_2_1_46_1","volume-title":"Communicating and Mobile Systems: The Pi-Calculus","author":"Milner R.","unstructured":"Milner , R. 1999. Communicating and Mobile Systems: The Pi-Calculus . Cambridge University Press , Cambridge, United Kingdom.]] Milner, R. 1999. Communicating and Mobile Systems: The Pi-Calculus. Cambridge University Press, Cambridge, United Kingdom.]]"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/361932.361937"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292561"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/359657.359659"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/353677.353681"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 1st Workshop on Logical Aspects of Cryptographic Protocol Verification","volume":"88","author":"Selinger P.","year":"2001","unstructured":"Selinger , P. 2001 . Models for an adversary-centric protocol logic . In Proceedings of the 1st Workshop on Logical Aspects of Cryptographic Protocol Verification ( Paris, France), J. Goubault-Larrecq, Ed. Electronic Notes in Theoretical Computer Science , vol. 55(1). Elsevier, Amsterdam, The Netherlands, 73-- 88 .]] Selinger, P. 2001. Models for an adversary-centric protocol logic. In Proceedings of the 1st Workshop on Logical Aspects of Cryptographic Protocol Verification (Paris, France), J. Goubault-Larrecq, Ed. Electronic Notes in Theoretical Computer Science, vol. 55(1). Elsevier, Amsterdam, The Netherlands, 73--88.]]"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14)","author":"Sumii E.","unstructured":"Sumii , E. , and Pierce , B. C . 2001. Logical relations and encryption (Extended abstract) . In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14) . IEEE Computer Society, Los Alamitos, Calif., 256--269.]] Sumii, E., and Pierce, B. C. 2001. Logical relations and encryption (Extended abstract). In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14). IEEE Computer Society, Los Alamitos, Calif., 256--269.]]"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/353629.353648"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/648235.753480"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1044731.1044735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T17:24:42Z","timestamp":1672248282000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1044731.1044735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1145\/1044731.1044735"],"URL":"https:\/\/doi.org\/10.1145\/1044731.1044735","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]},"assertion":[{"value":"2005-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
