Towards a Practical Secure Concurrent Language

DSpace/Manakin Repository

Towards a Practical Secure Concurrent Language

Citable link to this page

 

 
Title: Towards a Practical Secure Concurrent Language
Author: Muller, Stefan; Chong, Stephen N

Note: Order does not necessarily reflect citation order of authors.

Citation: Muller, Stefan, and Stephen Chong. 2012. Towards a Practical Secure Concurrent Language. In Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications - OOPSLA '12, 57-74. New York: ACM Press.
Full Text & Related Files:
Abstract: We demonstrate that a practical concurrent language can be extended in a natural way with information security mechanisms that provably enforce strong information security guarantees. We extend the X10 concurrent programming language with coarse-grained information-flow control. Central to X10 concurrency abstractions is the notion of a place: a container for data and computation. We associate a security level with each place, and restrict each place to store only data appropriate for that security level. When places interact only with other places at the same security level, then our security mechanisms impose no restrictions. When places of differing security levels interact, our information security analysis prevents potentially dangerous information flows, including information flow through covert scheduling channels. The X10 concurrency mechanisms simplify reasoning about information flow in concurrent programs. We present a static analysis that enforces a noninterference-based extensional information security condition in a calculus that captures the key aspects of X10's place abstraction and async-finish parallelism. We extend this security analysis to support many of X10's language features, and have implemented a prototype compiler for the resulting language.
Published Version: doi:10.1145/2384616.2384621
Other Sources: http://people.seas.harvard.edu/~chong/pubs/oopsla12-practical-secure-concurrent.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:12763609
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters