Modelling declassification policies using abstract domain completeness

DOI10.1017/S096012951100020XMaRDI QIDQ3103614zbMATH OpenDBLPWikidataFDO

Authors Isabella Mastroeni, Anindya Banerjee

Publication date 8 December 2011

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096012951100020X

zbMATH Keywords

declassification-based non-interference policyPaige-Tarjan algorithm for partition refinement

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• What you lose is what you leak: information leakage in declassification policies
• Linear Declassification
• Programming Languages and Systems
• Programming Languages and Systems
• A type system for robust declassification

Cites work

• A per model of secure information flow in sequential programs
• A semantic approach to secure information flow
• Abstract non-interference
• Comparing Completeness Properties of Static Analyses and Their Logics
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Guarded commands, nondeterminacy and formal derivation of programs
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• Making abstract interpretations complete
• Preserving Secrecy Under Refinement
• The octagon abstract domain
• Three Partition Refinement Algorithms

Cited in

(3)

• What you lose is what you leak: information leakage in declassification policies
• Programming Languages and Systems
• Linear Declassification

Describes a project that uses

Uses Software

• Octagon

This page was built for publication: Modelling declassification policies using abstract domain completeness

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