Noninterference for free

DOI10.1145/2784731.2784733MaRDI QIDQ2981948zbMATH OpenOpenAlexDBLPWikidataFDO

Authors William J. Bowman, Amal Ahmed

Publication date 10 May 2017

Published in Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2784731.2784733

zbMATH Keywords

dependencyfully abstract compilationinformation flowlogical relationsnoninterferenceparametricitypolymorphismsecure compilationsecurity

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Translating dependency into parametricity
• Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
• Noninterference through flow analysis
• Abstract non-interference
• Proving concurrent noninterference

Cited in

(9)

• Noninterference in a predicative polymorphic calculus for access control
• Noninterference with Local Policies
• Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
• On the versatility of open logical relations. Continuity, automatic differentiation, and a containment theorem
• Translating dependency into parametricity
• Fully Abstract and Robust Compilation
• Abstract semantic dependency
• Existential types for relaxed noninterference
• On the semantic expressiveness of iso- and equi-recursive types

This page was built for publication: Noninterference for free

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981948)