Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-Yao and for fully formalizing its security in the specification language of the Prototype Verification System PVS. Although cascade protocols could be argued to be a very limited model, it should be s...
Main Authors: | Mauricio Ayala-Rincón, Yuri Santos Rego |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Bologna
2013-01-01
|
Series: | Journal of Formalized Reasoning |
Subjects: | |
Online Access: | http://jfr.unibo.it/article/view/3720 |
Similar Items
-
Deductive Verification of the Sliding Window Protocol
by: D. A. Chkliaev, et al.
Published: (2015-03-01) -
Dealing with Degeneracies in Automated Theorem Proving in Geometry
by: Zoltán Kovács, et al.
Published: (2021-08-01) -
Formal verification of Matrix based MATLAB models using interactive theorem proving
by: Ayesha Gauhar, et al.
Published: (2021-03-01) -
A unit resolution theorem proving system
by: LeQuesne, Peter Neave
Published: (2011) -
Genetic diversity of transmission-blocking vaccine candidates Pvs25 and Pvs28 in <it>Plasmodium vivax </it>isolates from Yunnan Province, China
by: Feng Hui, et al.
Published: (2011-11-01)