{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:02:22Z","timestamp":1746244942694,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642547911"},{"type":"electronic","value":"9783642547928"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54792-8_1","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:35:12Z","timestamp":1395408912000},"page":"1-21","source":"Crossref","is-referenced-by-count":3,"title":["A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems"],"prefix":"10.1007","author":[{"given":"David","family":"Baelde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucca","family":"Hirschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. 28th Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115. ACM Press (2001)","DOI":"10.1145\/373243.360213"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.tcs.2003.12.023","volume":"322","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Fournet, C.: Private authentication. Theoretical Computer Science\u00a0322(3), 427\u2013476 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF00993053","volume":"8","author":"A. Anisimov","year":"1979","unstructured":"Anisimov, A., Knuth, D.: Inhomogeneous sorting. International Journal of Computer & Information Sciences\u00a08(4), 255\u2013260 (1979)","journal-title":"International Journal of Computer & Information Sciences"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: Proc. 23rd Computer Security Foundations Symposium (CSF 2010), pp. 107\u2013121. IEEE Comp. Soc. Press (2010)","DOI":"10.1109\/CSF.2010.15"},{"key":"1_CR5","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.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Baelde, D., Delaune, S., Hirschi, L.: A reduced semantics for deciding trace equivalence using constraint systems. ArXiv e-prints (January 2014)","DOI":"10.1007\/978-3-642-54792-8_1"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proc. 12th Conference on Computer and Communications Security. ACM (2005)","DOI":"10.1145\/1102120.1102125"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: Proc. 14th Computer Security Foundations Workshop (CSFW 2001), pp. 82\u201396. IEEE Comp. Soc. Press (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. Journal of Logic and Algebraic Programming (2008)","DOI":"10.1016\/j.jlap.2007.06.002"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-28869-2_6","volume-title":"Programming Languages and Systems","author":"R. Chadha","year":"2012","unstructured":"Chadha, R., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol.\u00a07211, pp. 108\u2013127. Springer, Heidelberg (2012)"},{"key":"1_CR11","unstructured":"Cheval, V.: APTE (2011), http:\/\/projects.lsv.ens-cachan.fr\/APTE\/"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: Trace equivalence decision: Negative tests and non-determinism. In: Proc. 18th Conference on Computer and Communications Security (CCS 2011). ACM Press (2011)","DOI":"10.1145\/2046707.2046744"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.04.016","volume":"492","author":"V. Cheval","year":"2013","unstructured":"Cheval, V., Cortier, V., Delaune, S.: Deciding equivalence-based properties using constraint solving. Theoretical Computer Science\u00a0492, 1\u201339 (2013)","journal-title":"Theoretical Computer Science"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., Rusinowitch, M.: Decidability of symbolic equivalence of derivations. Journal of Automated Reasoning\u00a048(2) (2012)","DOI":"10.1007\/s10817-010-9199-5"},{"key":"1_CR15","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":"C.J.F. Cremers","year":"2008","unstructured":"Cremers, C.J.F.: The Scyther Tool: Verification, falsification, and fnalysis of security protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 414\u2013418. Springer, Heidelberg (2008)"},{"key":"1_CR16","unstructured":"Hirschi, L.: R\u00e9duction d\u2019entrelacements pour l\u2019\u00e9quivalence de traces. RR LSV-13-13, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (September 2013)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. 8th ACM Conference on Computer and Communications Security (CCS 2001). ACM Press (2001)","DOI":"10.1145\/501983.502007"},{"issue":"4","key":"1_CR18","doi-asserted-by":"crossref","first-page":"575","DOI":"10.3233\/JCS-2009-0351","volume":"18","author":"S. M\u00f6dersheim","year":"2010","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L., Basin, D.A.: Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols. Journal of Computer Security\u00a018(4), 575\u2013618 (2010)","journal-title":"Journal of Computer Security"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","first-page":"7","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1998","unstructured":"Peled, D.: Ten years of partial order reduction. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 7\u201328. Springer, Heidelberg (1998)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc. 14th Computer Security Foundations Workshop (CSFW 2001), pp. 174\u2013190. IEEE Comp. Soc. Press (2001)","DOI":"10.1109\/CSFW.2001.930145"},{"key":"1_CR21","unstructured":"Tiu, A.: Spec (2010), http:\/\/users.cecs.anu.edu.au\/~tiu\/spec\/"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Tiu, A., Dawson, J.E.: Automating open bisimulation checking for the spi calculus. In: Proc. 23rd IEEE Computer Security Foundations Symposium (CSF 2010), pp. 307\u2013321. IEEE Computer Society Press (2010)","DOI":"10.1109\/CSF.2010.28"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54792-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:47:05Z","timestamp":1746157625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54792-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642547911","9783642547928"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54792-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}