Noninterference in a predicative polymorphic calculus for access control

DOI10.1016/J.CL.2013.06.001MaRDI QIDQ2339144zbMATH OpenOpenAlexFDO

Authors Sepehr Amir-Mohammadian, Mehran S. Fallah

Publication date 31 March 2015

Published in Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cl.2013.06.001

zbMATH Keywords

denotational semanticsaccess controlnoninterferencepredicative polymorphism

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Noninterference for free
• scientific article; zbMATH DE number 1754606
• Decidability and proof systems for language-based noninterference relations
• Computer Science Logic
• Typed Lambda Calculi and Applications

Cites work

• AURA
• Access control in a core calculus of dependency
• Game semantics for access control
• Information flow inference for ML
• Logic of infons, the propositional case
• Notions of computation and monads
• Programming Languages and Systems
• Secure information flow via linear continuations
• Stack-based access control and secure information flow
• State-dependent representation independence
• Translating dependency into parametricity
• Variations in Access Control Logic

Cited in

(5)

• Access control in a core calculus of dependency
• Characterizing intransitive noninterference for 3-domain security policies with observability
• Type-based access control in data-centric systems
• Architectural refinement and notions of intransitive noninterference
• Trustworthy Global Computing

Describes a project that uses

Uses Software

• Fable
• AURA

This page was built for publication: Noninterference in a predicative polymorphic calculus for access control

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