The Shadow Knows: Refinement of Ignorance in Sequential Programs
From MaRDI portal
Recommendations
- The shadow knows: refinement and security in sequential programs
- Sequential Machines, Ambiguity, and Dynamic Programming
- Demonic, angelic and unbounded probabilistic choices in sequential programs
- A FOOLish encoding of the next state relations of imperative programs
- Non-obfuscated unprovable programs \& many resultant subtleties
- scientific article; zbMATH DE number 2044529
- Reasoning about probabilistic sequential programs
Cited in
(18)- Behaviour approximated on subgroups
- Checking noninterference in timed CSP
- Security invariants in discrete transition systems
- Abstractions of non-interference security: probabilistic versus possibilistic
- Program algebra for quantitative information flow
- scientific article; zbMATH DE number 1693541 (Why is no real title available?)
- Scheduler-independent declassification
- How to brew-up a refinement ordering
- Preserving Secrecy Under Refinement
- Information flow in systems with schedulers. II: Refinement
- Compositional refinement in agent-based security protocols
- Compositional noninterference from first principles
- Algebra for quantitative information flow
- Preface
- Program semantics and verification technique for AI-centred programs
- An SMT-based approach to the verification of knowledge-based programs
- The shadow knows: refinement and security in sequential programs
- Using probabilistic Kleene algebra pKA for protocol verification
This page was built for publication: The Shadow Knows: Refinement of Ignorance in Sequential Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618832)
