Abstract for "The SLam Calculus: Programming with Secrecy and Integrity"

The SLam Calculus: Programming with Secrecy and Integrity
Nevin C. Heintze and Jon G. Riecke. 1997.

Abstract: We describe the SLam calculus, a typed lambda-calculus that maintains security information as well as type information. The type system propagates both secrecy and integrity, maintaining four distinct forms of security information: which agents could have created an object, which agents may read an object, and which agents may indirectly, through flow-of-control or the actions of other agents, create or read objects. We prove that the type system prevents run-time security violations, and give some examples of the power of the system.