{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:27:21Z","timestamp":1767652041576},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548611"},{"type":"electronic","value":"9783642548628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54862-8_50","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:33:34Z","timestamp":1395408814000},"page":"587-592","source":"Crossref","is-referenced-by-count":29,"title":["APTE: An Algorithm for Proving Trace Equivalence"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Cheval","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Machine readable travel document. Technical Report 9303, International Civil Aviation Organization (2008)"},{"issue":"3","key":"50_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"},{"key":"50_CR3","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: 14th Computer Security Foundations Workshop, CSFW 2001 (2001)"},{"issue":"1","key":"50_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2007.06.002","volume":"75","author":"B. Blanchet","year":"2008","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. Journal of Logic and Algebraic Programming\u00a075(1), 3\u201351 (2008)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"50_CR5","series-title":"Phd thesis","volume-title":"Automatic verification of cryptographic protocols: privacy-type properties","author":"V. Cheval","year":"2012","unstructured":"Cheval, V.: Automatic verification of cryptographic protocols: privacy-type properties. Phd thesis. ENS Cachan, France (2012)"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-36830-1_12","volume-title":"Principles of Security and Trust","author":"V. Cheval","year":"2013","unstructured":"Cheval, V., Blanchet, B.: Proving more observational equivalences with ProVerif. In: Basin, D., Mitchell, J.C. (eds.) POST 2013. LNCS, vol.\u00a07796, pp. 226\u2013246. Springer, Heidelberg (2013)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: Trace equivalence decision: Negative tests and non-determinism. In: 18th ACM Conference on Computer and Communications Security, CCS 2011 (2011)","DOI":"10.1145\/2046707.2046744"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/978-3-642-39799-8_50","volume-title":"Computer Aided Verification","author":"V. Cheval","year":"2013","unstructured":"Cheval, V., Cortier, V., Plet, A.: Lengths may break privacy \u2013 or how to check for equivalences with length. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 708\u2013723. Springer, Heidelberg (2013)"},{"key":"50_CR9","unstructured":"Ciob\u00e2c\u0103, \u015e.: Automated Verification of Security Protocols with Applications to Electronic Voting. Th\u00e8se de doctorat, Laboratoire Sp\u00e9cification et V\u00e9rification. ENS Cachan, France (December 2011)"},{"key":"50_CR10","first-page":"119","volume-title":"CCS 2008: Proceedings of the 15th ACM Conference on Computer and Communications Security","author":"C.J.F. Cremers","year":"2008","unstructured":"Cremers, C.J.F.: Unbounded verification, falsification, and characterization of security protocols by pattern refinement. In: CCS 2008: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 119\u2013128. ACM, New York (2008)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Grewal, G., Ryan, M., Bursuc, S., Ryan, P.: Caveat coercitor: Coercion-evidence in electronic voting. In: IEEE Symposium on Security and Privacy, pp. 367\u2013381. IEEE Computer Society (2013)","DOI":"10.1109\/SP.2013.32"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Tiu, A., Dawson, J.: 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"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Vigan\u00f2, L.: Automated security protocol analysis with the avispa tool. In: Proceedings of the XXI Mathematical Foundations of Programming Semantics (MFPS 2005). ENTCS, vol.\u00a0155, pp. 61\u201386. Elsevier (2006)","DOI":"10.1016\/j.entcs.2005.11.052"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54862-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T12:19:59Z","timestamp":1558873199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54862-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548611","9783642548628"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54862-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}