Rule based programming in Java for protocol verification

Horatiu Cirstea 1 Pierre-Etienne Moreau 1 Antoine Reilles 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00100025
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:13:25 AM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM

Identifiers

  • HAL Id : inria-00100025, version 1

Collections

Citation

Horatiu Cirstea, Pierre-Etienne Moreau, Antoine Reilles. Rule based programming in Java for protocol verification. 5th International Workshop on Rewriting Logic and its Applications - WRLA'2004, Narciso Marti-Oliet, 2004, Barcelona, Spain, 18 p. ⟨inria-00100025⟩

Share

Metrics

Record views

300