A per model of secure information flow in sequential programs

DOI10.1023/A:1011553200337MaRDI QIDQ5936652zbMATH OpenOpenAlexFDO

Authors Andrei Sabelfeld, David Sands

Publication date 3 July 2001

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011553200337

zbMATH Keywords

confidentialitynoninterferencepartial equivalence relationspowerdomainsprobabilistic covert channelssecuritysemantics

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Abstract data types; algebraic specification (68Q65)

Recommendations

• Semantic models for the security of sequential and concurrent programs
• Secure Information Flow as a Safety Property
• A semantic approach to secure information flow
• Compile-time detection of information flow in sequential programs
• scientific article; zbMATH DE number 1692935

Cited in

(29)

• A semantic approach to secure information flow
• A demonic lattice of information
• Optimality and condensing of information flow through linear refinement
• Semantic models for the security of sequential and concurrent programs
• Information flow analysis for valued-indexed data security compartments
• Secured information flow for asynchronous sequential processes
• Modelling declassification policies using abstract domain completeness
• Compositional refinement in agent-based security protocols
• scientific article; zbMATH DE number 2080702 (Why is no real title available?)
• A monadic analysis of information flow security with mutable state
• scientific article; zbMATH DE number 1884409 (Why is no real title available?)
• Model-driven information flow security for component-based systems
• What you lose is what you leak: information leakage in declassification policies
• Algebra for quantitative information flow
• Deriving Bisimulations by Simplifying Partitions
• Mechanizing Mathematical Reasoning
• Quantification of integrity
• Timing-sensitive information flow analysis for synchronous systems
• Quantifying probabilistic information flow in computational reactive systems
• Static Analysis
• Adjunctions on the lattices of partitions and of partial partitions
• Idempotent block splitting on partial partitions. I: Isotone operators
• Temporal hyperproperties for population protocols
• A Cartesian closed category for random variables
• Extensions of HyperLTL for asynchronous hyperproperties
• Compile-time detection of information flow in sequential programs
• A temporal logic for asynchronous hyperproperties
• The shadow knows: refinement and security in sequential programs
• Linearity and bisimulation

This page was built for publication: A per model of secure information flow in sequential programs

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