We formally describe an intruder that is suitable for checking fairness properties of security protocols. The intruder is proved to be equivalent to the Dolev-Yao intruder that respects the resilient communication channels assumption, in the sense that, if a fairness property holds in one of these models, it also holds in the other
Motivated by Murray’s work on the limits of refinement testing for CSP, we propose the use of ProB t...
Most model checking techniques for security protocols make a number of simplifying assumptions on th...
Colloque avec actes et comité de lecture. internationale.International audienceWe propose a protocol...
We formally describe an intruder that is suitable for checking fairness properties of security proto...
We present a process algebraic intruder model for verifying a class of liveness properties of securi...
We present a process algebraic intruder model for verifying a class of liveness properties of securi...
Liveness properties do, in general, not hold in the Dolev-Yao attacker model, unless we assume that ...
AbstractThis paper contributes to further closing the gap between formal analysis and concrete imple...
This paper contributes to further closing the gap between formal analysis and concrete implementatio...
We design and analyze a simple optimistic fair non-repudiation protocol. Our protocol is considerabl...
We design and analyze a simple optimistic fair non-repudiation protocol. Our protocol is considerabl...
We design and model-check a simple optimistic fair non-repudiation protocol. Our protocol is conside...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
Abstract. In formal methods, security protocols are usually modeled at a high level of abstraction. ...
Motivated by Murray’s work on the limits of refinement testing for CSP, we propose the use of ProB t...
Most model checking techniques for security protocols make a number of simplifying assumptions on th...
Colloque avec actes et comité de lecture. internationale.International audienceWe propose a protocol...
We formally describe an intruder that is suitable for checking fairness properties of security proto...
We present a process algebraic intruder model for verifying a class of liveness properties of securi...
We present a process algebraic intruder model for verifying a class of liveness properties of securi...
Liveness properties do, in general, not hold in the Dolev-Yao attacker model, unless we assume that ...
AbstractThis paper contributes to further closing the gap between formal analysis and concrete imple...
This paper contributes to further closing the gap between formal analysis and concrete implementatio...
We design and analyze a simple optimistic fair non-repudiation protocol. Our protocol is considerabl...
We design and analyze a simple optimistic fair non-repudiation protocol. Our protocol is considerabl...
We design and model-check a simple optimistic fair non-repudiation protocol. Our protocol is conside...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
Abstract. In formal methods, security protocols are usually modeled at a high level of abstraction. ...
Motivated by Murray’s work on the limits of refinement testing for CSP, we propose the use of ProB t...
Most model checking techniques for security protocols make a number of simplifying assumptions on th...
Colloque avec actes et comité de lecture. internationale.International audienceWe propose a protocol...