Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Theoretical Computer Science
Information and Computation
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Distributed Pi-Calculus
Resource access and mobility control with dynamic privileges acquisition
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Typed processes in untyped contexts
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Hi-index | 0.00 |
Traditional static typing systems for the pi-calculus are built around capability types that control the read/write access rights on channels and describe the type of the channels' payload. While static typing has proved adequate for reasoning on process behavior in typed contexts, dynamic techniques have often been advocated as more effective for access control in distributed/untyped contexts. We study the relationships between the two approaches - static versus dynamic - by contrasting two versions of the asynchronous pi-calculus. The former, API, comes with an entirely standard static typing system. The latter, API@, combines static and dynamic typing: a static type system associates channels with flat types that only express read/write capabilities and disregard the payload type, while a dynamically typed synchronization complements the static type system to guarantee type soundness. We show that API@can be encoded into API in a fully abstract manner, preserving the respective behavioral equivalences of the two calculi. Besides yielding an interesting expressivity result, the encoding also sheds light on the effectiveness of dynamic typing as a mechanism for access control.