Abstract

Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency common to these settings that can be captured within a single calculus, the Dependency Core Calculus (DCC), a small extension of Moggi's computational lambda calculus. To establish this thesis, we translate typed calculi for secure information flow, binding-time analysis, slicing, and call-tracking into DCC. The translations help clarify aspects of the source calculi. We also define a semantic model for DCC and use it to give simple proofs of noninterference results for each case. 1 Introduction Systems that incorporate aspects of program dependency arise in many different contexts. For example, type systems for secure information flow trace dependencies between outputs and inputs of a computation. These type systems are meant to guarantee secrecy and integrity. In the Secure Lambda (SLam) Calculus [13] and the w...

Citations