Download Now Free registration required
The authors 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: guaranteed termination, after which the result is either unbounded correctness, falsification, or bounded correctness. Efficient generation of a finite representation of an infinite set of traces in terms of patterns, also known as a complete characterization. State-of-the-art performance, which has made new types of protocol analysis feasible, such as multi-protocol analysis.
- Format: PDF
- Size: 627 KB