Name
Abstract | ||
|---|---|---|
This paper presents an approach for the development of model-checkers in a framework, called TOM, merging declarative and imperative features. We illustrate our method by specifying in TOM the Needham-Schroeder public-key protocol that aims to establish a mutual authentication between an initiator and a responder that communicate via an insecure network. We describe the behavior of the agents exchanging messages as well as the intruders and the security invariants the protocol should verify using the rewrite rules of TOM. The (depth-first or breadth-first) exploration of the search space is described using the imperative features of the language. We propose several optimizations and we compare our results to existing approaches. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.entcs.2004.06.022 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
model-checkers,needham-schroeder public-key protocol,insecure network,imperative feature,java,rule-based programming,tom,mutual authentication,search space,protocol verification,public key | Mutual authentication,Rule-based system,Programming language,Model checking,Computer science,Theoretical computer science,Invariant (mathematics),Rewriting,Protocol verification,Merge (version control),Java | Journal |
Volume | Issue | ISSN |
117 | C | 1571-0661 |
Citations | PageRank | References |
2 | 0.42 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Horatiu Cirstea | 1 | 164 | 15.93 |
| Pierre-etienne Moreau | 2 | 598 | 40.40 |
| Antoine Reilles | 3 | 119 | 6.79 |