Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder

Autor: Klay, Francis, Santiago, Judson, Vigneron, Laurent

Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this p

Externí odkaz: http://arxiv.org/abs/0710.3305

Rewriting for Cryptographic Protocol Verification - Extended Version

Autor: Genet, Thomas, Klay, Francis

Publikováno v: [Research Report] RR-3921, INRIA. 2000

On a case study, we present a new approach for verifying cryptographic protocols, based on rewriting and on tree automata techniques. Protocols are operationally described using Term Rewriting Systems and the initial set of communication requests is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b07b63f8dadebf4da9545bf39b745d9e
https://inria.hal.science/inria-00072731/file/RR-3921.pdf

Analysing Feature Interactions with Automated Deduction Systems

Autor: Klay, Francis, Rusinowitch, Michaël, Stratulat, Sorin

Publikováno v: [Intern report] 98-R-230 || klay98a, 1998, 21 p
7th International Conference on Telecommunication Systems Modeling & Analysis
7th International Conference on Telecommunication Systems Modeling & Analysis, Bezalel Gavish, 1999, Nashville, Tennessee, USA, 33 p

Colloque avec actes et comité de lecture.; Finding feature interactions in telephony systems becomes more problematic with the continuously increasing number of services offered by them. In this paper, we present how to employ an automated system fo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c6274b0bd16f422624da9a30813deccd
https://hal.inria.fr/inria-00098562

Unification in syntactic theories

Autor: Klay, Francis

Publikováno v: Autre. Université Henri Poincaré-Nancy 1, 1992. Français. ⟨NNT : 1992NAN10331⟩

Not available
L'objectif de cette thèse est l'étude d'une sous-classe des théories équationnelles appelée classe des théories syntaxiques. Après avoir introduit les notions de base, un ensemble de règles pour l'unification par décomposi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::53fb7875a0530c0f2ba081acf5046cab
https://hal.univ-lorraine.fr/tel-01753472

Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder.

Autor: Klay, Francis, Vigneron, Laurent

Publikováno v: Formal Aspects in Security & Trust (9783642014642); 2009, p192-209, 18p