 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n |
Model
checking basics
|
|
| n |
The security property we want to verify is expressed
|
|
|
as a temporal logic formula F
|
|
| n |
The protocol is expressed as a system S of processes
|
|
(the processes involved with the protocol and,
|
|
|
possibly, the intruder)
|
|
| n |
S is represented as a labeled transition system T,
|
|
|
which is seen as an interpretation of F
|
|
| n |
Model checking consists in showing that T is a model
|
|
|
of F, namely that T validates F
|
|
|
n |
Always possible with Finite State systems
|
|
|
n |
Also possible for some restricted cases of Infinite
State
|
|
|
systems
|
|
