Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a number of novel features, including: (1) Guaranteed termination, after which the result is either unbounded correctness, falsi...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2008
|