Abstract : A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it is demonstrated that this fragment covers an important subset of applied pi-calculus which is practically useful for analyzing security protocols.
https://hal.inria.fr/hal-01054457 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Wednesday, August 6, 2014 - 4:25:18 PM Last modification on : Wednesday, August 9, 2017 - 12:03:10 PM Long-term archiving on: : Wednesday, November 26, 2014 - 1:00:34 AM
Jia Liu, Huimin Lin. Proof System for Applied Pi Calculus. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.229-243, ⟨10.1007/978-3-642-15240-5_17⟩. ⟨hal-01054457⟩