Automatic Compilation of Protocol Insecurity Problems into Logic Programming


In this paper we show how protocol insecurity problems expressed in a multi-set rewriting formalism can be automatically translated into logic programming problems. The proposed translation paves the way to the construction of model-checkers for security protocols based on state-of-the-art solvers for logic programs. We have assessed the effectiveness of… (More)
DOI: 10.1007/978-3-540-30227-8_51


1 Figure or Table