A Complete Symbolic Bisimulation for Full Applied Pi Calculus充分应用pi演算的一个完整的符号互模拟.ppt

A Complete Symbolic Bisimulation for Full Applied Pi Calculus Jia Liu and Huimin Lin Institute of Software, Chinese Academy of Sciences Accepted for SOFSEM2010 Outline Background Motivation Symbolic Semantics Conclusion Applied Pi Calculus M. Abadi and C. Fournet , 2001 Description and analysis of cryptographic protocols Communication, Concurrency and Scope extrusion Primitive Functions: f, enc, dec Equational Theory: Syntax Active Substitution {M/x} x can be regarded as an alias of term M Floats and applies to the process coming into contact with it Partial environment knowledge Special mechanism for outputting compound messages Operational Semantics Example Labeled Bisimilarity Static Equivalence Labeled Bisimilarity Labeled bisimilarity coincides with barbed equivalence. Problem Automated Verification Infinite number of possible behaviors of the attacker Symbolic theory: more amenable and efficient Symbolic Theory Symbolic Theory basic idea: a variable with constraints value-passing CCS: originally proposed by M.Hennessy and H.Lin Pi-Calculus: by M.Boreale and R.De Nicola and independently by H.Lin Symbolic Transition Relation: Symbolic Bisimilarity: Symbolic Semantics for Applied Pi Calculus Structural Equivalence Unexpectedly technically difficult general data structure mobility mechanism of alias Related Work S. Delaune, S. Kremer and M. D. Ryan , Symbolic Bisimulation for the Applied Pi- Calculus, FSTTCS07 Intermediate Representation: Circumventing the difficulties caused by Intermediate Processes: a selected but sufficient subset Bridging the gap between symbolic semantics and concrete semantics Deficiencies Complicated: sound but incomplete: absence of partition of constraints, informally, Finite fragment of the calculus: infinitely many name binders Symbolic Semantics Symbolic Bisimilarity : sound and complete w.r.t Infinite Fragment of Applied Pi Intermediate Representation Trans