The Higher-Order, Call-by-Value Applied Pi-Calculus
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this calculus. Such development has been notoriously difficult because of the subtle interactions among generative names, processes as data, and the algebraic operations. We handle them by carefully defining the calculus and adopting Sumii et al.’s environmental bisimulation, and thereby give (to our knowledge) the first “useful” proof method in this setting. We demonstrate the utility of our method through examples involving both higher-order processes and asymmetric cryptography.
Unable to display preview. Download preview PDF.
- 1.Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 104–115 (2001)Google Scholar
- 2.Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1–70 (1999); Preliminary version appeared in Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 36–47 (1997)Google Scholar
- 4.Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. In: 20th Annual IEEE Symposium on Logic in Computer Science, pp. 331–340 (2005)Google Scholar
- 7.Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigm. PhD thesis, University of Edinburgh (1992)Google Scholar
- 8.Sangiorgi, D., Kobayashi, N., Sumii, E.: Appendices to “environmental bisimulations for higher-order languages”, http://www.cs.unibo.it/~sangio/DOC_public/appLICS07.pdf
- 9.Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Twenty-Second Annual IEEE Symposium on Logic in Computer Science, pp. 293–302 (2007)Google Scholar
- 12.Sato, N., Sumii, E.: Proofs for “the higher-order, call-by-value applied pi-calculus”, http://www.kb.ecei.tohoku.ac.jp/~nsato/hoapp.pdf
- 13.Schneier, B.: Applied Cryptography. John Wiley & Sons, Inc., Chichester (1996)Google Scholar
- 14.Sumii, E., Pierce, B.C.: A bisimulation for dynamic sealing. Theoretical Computer Science 375(1-3), 169–192 (2004); Extended abstract appeared in Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 161–172 (2004)Google Scholar
- 15.Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. Journal of the ACM 54(5-26), 1–43 (2007); Extended abstract appeared in Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 63–74 (2005)Google Scholar