Verification of Security Protocols with Lists: from Length One to Unbounded Length
Abstract
no abstract
Journal Articles
Journal of Computer Security
Year : 2013
Ben Smyth : Connect in order to contact the contributor
https://inria.hal.science/hal-00939187
Submitted on : Thursday, January 30, 2014-1:11:10 PM
Last modification on : Friday, January 21, 2022-3:16:07 AM
Dates and versions
Identifiers
- HAL Id : hal-00939187 , version 1
Cite
Miriam Paiola, Bruno Blanchet. Verification of Security Protocols with Lists: from Length One to Unbounded Length. Journal of Computer Security, 2013, 21 (6), pp.781--816. ⟨hal-00939187⟩
35
View
0
Download