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.
Type de document :
Communication dans un congrès
Cristian S. Calude; Vladimiro Sassone. 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. Springer, IFIP Advances in Information and Communication Technology, AICT-323, pp.229-243, 2010, Theoretical Computer Science. 〈10.1007/978-3-642-15240-5_17〉
https://hal.inria.fr/hal-01054457
Contributeur : Hal Ifip
<>
Soumis le : mercredi 6 août 2014 - 16:25:18
Dernière modification le : mercredi 9 août 2017 - 12:03:10
Document(s) archivé(s) le : mercredi 26 novembre 2014 - 01:00:34
Jia Liu, Huimin Lin. Proof System for Applied Pi Calculus. Cristian S. Calude; Vladimiro Sassone. 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. Springer, IFIP Advances in Information and Communication Technology, AICT-323, pp.229-243, 2010, Theoretical Computer Science. 〈10.1007/978-3-642-15240-5_17〉. 〈hal-01054457〉
