Trust in the pi-calculus

Mark Hepburn, David Wright
2001 Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '01  
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus [13, 14, 15 ] as a modelling tool. A Type system using boolean annotations guarantees that no run-time errors due to untrusted data being used in a trusted context are possible. We improve on other similar systems[18] by introducing a safe environment in which trust-coercion can be performed based on the results of run-time checks. An algorithm for deducing the most general types for the type system is presented.
doi:10.1145/773184.773196 dblp:conf/ppdp/HepburnW01 fatcat:j4d7bcucyne6lp4mvv4iyn2ubu