POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The name discipline of uniform receptiveness
Theoretical Computer Science
Secrecy by typing in security protocols
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Secrecy types for asymmetric communication
Theoretical Computer Science - Foundations of software science and computation structures
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Authenticity by typing for security protocols
Journal of Computer Security - Special issue on CSFW14
Trust and Partial Typing in Open Systems of Mobile Agents
Journal of Automated Reasoning
A generic type system for the Pi-calculus
Theoretical Computer Science
Ensuring termination by typability
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2000
A type discipline for authorization policies
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Trustworthy Global Computing
The Space and Motion of Communicating Agents
The Space and Motion of Communicating Agents
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Journal of Logic and Computation
A hybrid type system for lock-freedom of mobile processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Instant polymorphic type systems for mobile process calculi: just add reduction rules and close
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Name-Passing Calculi: From Fusions to Preorders and Types
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A large variety of process calculi extend the π-calculus with more general notions of messages. Bengtson et al. have shown that many of these π-like calculi can be expressed as so-called ψ-calculi. In this paper, we describe a simple type system for ψ-calculi. The type system satisfies a subject reduction property and a general notion of channel safety. A number of existing systems are shown to be instances of our system, and other, new type systems can also be obtained. We first present a new type system for the calculus of explicit fusions by Wischik and Gardner, then one for the distributed π-calculus of Hennessy and Riely and finally show how existing type systems for secrecy and authenticity in the spi calculus can be represented and shown to be safe.