Modelling declassification policies using abstract domain completeness

DOI10.1017/S096012951100020XzbMath1252.68079WikidataQ62046218 ScholiaQ62046218MaRDI QIDQ3103614

Isabella Mastroeni, Anindya Banerjee

Publication date: 8 December 2011

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Uses Software

• Octagon

Cites Work

• The octagon abstract domain
• A semantic approach to secure information flow
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Abstract non-interference
• Preserving Secrecy Under Refinement
• Three Partition Refinement Algorithms
• Guarded commands, nondeterminacy and formal derivation of programs
• Making abstract interpretations complete
• Comparing Completeness Properties of Static Analyses and Their Logics
• A per model of secure information flow in sequential programs
• Unnamed Item

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