Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approach.
|Titolo:||Formal Verification of Security Protocol Implementations: A Survey|
|Data di pubblicazione:||2014|
|Digital Object Identifier (DOI):||10.1007/s00165-012-0269-9|
|Appare nelle tipologie:||1.1 Articolo in rivista|