{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T20:59:24Z","timestamp":1761339564140,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496343"},{"type":"electronic","value":"9783662496350"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49635-0_12","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:03:52Z","timestamp":1458547432000},"page":"233-253","source":"Crossref","is-referenced-by-count":7,"title":["AIF- $$\\omega $$ \u03c9 : Set-Based Protocol Abstraction with Countable Families"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"M\u00f6dersheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Bruni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"12_CR1","doi-asserted-by":"publisher","first-page":"743","DOI":"10.3233\/JCS-140501","volume":"22","author":"M Arapinis","year":"2014","unstructured":"Arapinis, M., Phillips, J., Ritter, E., Ryan, M.D.: Statverif: verification of stateful processes. J. Comput. Secur. 22(5), 743\u2013821 (2014)","journal-title":"J. Comput. Secur."},{"key":"12_CR2","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: Computer Security Foundations Workshop (2001)"},{"key":"12_CR3","unstructured":"Bruni, A., Modersheim, S.: The AIF-\n                      \n                        \n                      \n                      $$\\omega $$\n                      \n                        \n                          \u03c9\n                        \n                      \n                     Compiler and Examples. \n                      http:\/\/www.compute.dtu.dk\/~samo\/aifom.html"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bruni, A., M\u00f6dersheim, S., Nielson, F., Nielson, H.R.: Set-pi: set membership p-calculus. In: IEEE 28th Computer Security Foundations Symposium, CSF 2015 (2015)","DOI":"10.1109\/CSF.2015.20"},{"issue":"1\u20133","key":"12_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.scico.2003.12.002","volume":"50","author":"H Comon-Lundh","year":"2004","unstructured":"Comon-Lundh, H., Cortier, V.: Security properties: two agents are sufficient. Sci. Comput. Program. 50(1\u20133), 51\u201371 (2004)","journal-title":"Sci. Comput. Program."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-03459-6_7","volume-title":"Foundations and Applications of Security Analysis","author":"S Fr\u00f6schle","year":"2009","unstructured":"Fr\u00f6schle, S., Steel, G.: Analysing PKCS#11 key management apis with unbounded fresh data. In: Degano, P., Vigan\u00f2, L. (eds.) ARSPA-WITS 2009. LNCS, vol. 5511, pp. 92\u2013106. Springer, Heidelberg (2009)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Kremer, S., K\u00fcnnemann, R.: Automated analysis of security protocols with global state. In: Security and Privacy (2014)","DOI":"10.1109\/SP.2014.18"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-39799-8_48","volume-title":"Computer Aided Verification","author":"S Meier","year":"2013","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 696\u2013701. Springer, Heidelberg (2013)"},{"key":"12_CR9","unstructured":"Ye, M.: Design and analysis of PKCS#11 key management with AIF. Master\u2019s thesis, DTU Compute (2014). \n                      www2.compute.dtu.dk\/~samo"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S.: Abstraction by set-membership: verifying security protocols and web services with databases. In: Computer and Communications Security (2010)","DOI":"10.1145\/1866307.1866348"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S., Modesti, P.: Verifying sevecom using set-based abstraction. In: Proceedings of the 7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011, Istanbul, Turkey, 4\u20138 July 2011 (2011)","DOI":"10.1109\/IWCMC.2011.5982705"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-48660-7_29","volume-title":"Automated Deduction - CADE-16","author":"C Weidenbach","year":"1999","unstructured":"Weidenbach, C.: Towards an automatic analysis of security protocols in first-order logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 314\u2013328. Springer, Heidelberg (1999)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS version 3.5. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 140\u2013145. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49635-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:27:25Z","timestamp":1559406445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49635-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496343","9783662496350"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49635-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}