Linear Declassification

DOI10.1007/978-3-540-78739-6_18MaRDI QIDQ5458399zbMATH OpenOpenAlexFDO

Authors Yûta Kaneko, Naoki Kobayashi

Publication date 11 April 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78739-6_18

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• A type system for robust declassification
• What you lose is what you leak: information leakage in declassification policies
• Scheduler-independent declassification
• Modelling declassification policies using abstract domain completeness
• Who Can Declassify?

Cited in

(10)

• Programming Languages and Systems
• A type system for robust declassification
• What you lose is what you leak: information leakage in declassification policies
• Automated enforcement for relaxed information release with reference points
• Programming Languages and Systems
• Scheduler-independent declassification
• Modelling declassification policies using abstract domain completeness
• Who Can Declassify?
• A semantic framework for declassification and endorsement
• Existential types for relaxed noninterference

This page was built for publication: Linear Declassification

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