Execution Contexts for Determining Trust in a Higher-Order pi-Calculus

Abstract

A type system for the higher order pi-calculus is presented, using boolean annotations to carry information about the integrity of data. This extends previous work by the authors for a first order calculus; we argue that in a higher order setting certain notions of trustedness depend on the potential for communication during execution. In addition, we develop a statically determinable method for performing safe run-time trust coercions.