In this dissertation we present a general , extensible methodology that examines cryptographic protocols . our approach is specify a protocol in cpal ( cryptographic protocol analysis language ) , apply hoare and dijkstra ? theory of formal semantics to it , analysis it ? forma ] semantics , define weakest precondition of each kind of language statement 我们的方法就是用cpal （ cryptographicprotocolanalysislanguage ）语言来表示协议，将hoare和dijkstra在形式语义方面的理论应用到该语言，分析该语言的形式语义，定义每种语句的最弱前置条件。
您当前位置：