Automated Analysis of Infinite Scenarios |
Mikael Buchholtz
|
| Abstract | The security of a network protocol crucially relies on the scenario in which the protocol is deployed. This paper describes syntactic constructs for modelling network scenarios and presents an automated analysis tool, which can guarantee that security properties hold in all of the (infinitely many) instances of a scenario. The tool is based on control flow analysis of the process calculus LySa and is applied to the Bauer, Berson, and Feiertag protocol where is reveals a previously undocumented problem, which occurs in some scenarios but not in other. |
| Type | Conference paper [With referee] |
| Conference | Symposium on Trustworthy Global Computing |
| Year | 2005 |
| Series | Lecture Notes of Computer Science |
| Note | To appear |
| BibTeX data | [bibtex] |
| IMM Group(s) | Computer Science & Engineering |