Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Faceted execution of policy-agnostic programs

Faceted execution of policy-agnostic programs

Thumbnail Image
Download
Name

Solar-Lezama_Faceted execution.pdf

Size

237.09 KB

Format

Adobe PDF

Checksum (MD5)

4ec028035b25644026d601523f53cbab

Author(s)
Austin, Thomas H.
•
Yang, Jean
•
Flanagan, Cormac
•
Solar-Lezama, Armando
Date Issued
June 2013
Journal
Proceedings of the Eighth ACM SIGPLAN workshop on Programming languages and analysis for security (PLAS '13)
Publisher
Association for Computing Machinery (ACM)
Citation
Thomas H. Austin, Jean Yang, Cormac Flanagan, and Armando Solar-Lezama. 2013. Faceted execution of policy-agnostic programs. In Proceedings of the Eighth ACM SIGPLAN workshop on Programming languages and analysis for security (PLAS '13). ACM, New York, NY, USA, 15-26.
Version
Author's final manuscript
Abstract
It is important for applications to protect sensitive data. Even for simple confidentiality and integrity policies, it is often difficult for programmers to reason about how the policies should interact and how to enforce policies across the program. A promising approach is policy-agnostic programming, a model that allows the programmer to implement policies separately from core functionality. Yang et al. describe Jeeves, a programming language that supports information flow policies describing how to reveal sensitive values in different output channels. Jeeves uses symbolic evaluation and constraint-solving to produce outputs adhering to the policies. This strategy provides strong confidentiality guarantees but limits expressiveness and implementation feasibility. We extend Jeeves with faceted values, which exploit the structure of sensitive values to yield both greater expressiveness and to facilitate reasoning about runtime behavior. We present a faceted semantics for Jeeves and describe a model for propagating multiple views of sensitive information through a program. We provide a proof of termination-insensitive non-interference and describe how the semantics facilitate reasoning about program behavior.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/90875
DOI of Published Version
https://doi.org/10.1145/2465106.2465121
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.