Compositional noninterference from first principles

DOI10.1007/s00165-010-0167-yzbMath1242.68071OpenAlexW2070005378MaRDI QIDQ432152

Carroll Morgan

Publication date: 3 July 2012

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-010-0167-y

zbMATH Keywords

securitycompositionalitynoninterferencerefinementrefinement paradoxtesting semantics

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Stepwise refinement of heap-manipulating code in Chalice ⋮ Precise quantitative information flow analysis -- a symbolic approach ⋮ On integrating confidentiality and functionality in a formal method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theoretical basis for stepwise refinement and the programming calculus
• The shadow knows: refinement and security in sequential programs
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Power domains
• Probabilistic models for the guarded command language
• How to Brew-up a Refinement Ordering
• The Secret Art of Computer Programming
• Preserving Secrecy Under Refinement
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• The B-Book
• Refinement Calculus
• Abstraction, Refinement and Proof for Probabilistic Systems
• An axiomatic basis for computer programming
• Program development by stepwise refinement

This page was built for publication: Compositional noninterference from first principles