A security flow control algorithm and its denotational semantics correctness proof
From MaRDI portal
Publication:1203126
DOI10.1007/BF03180570zbMath0758.68044OpenAlexW2054696368WikidataQ115149361 ScholiaQ115149361MaRDI QIDQ1203126
Publication date: 4 February 1993
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03180570
Network design and communication in computer systems (68M10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (2)
Symbolic abstract heaps for polymorphic information-flow guard inference ⋮ Abstract interpretation of operational semantics for secure information flow.
Cites Work
- Two-level semantics and abstract interpretation
- Strictness analysis for higher-order functions
- Monotone data flow analysis frameworks
- Program transformations in a denotational setting
- An Axiomatic Approach to Information Flow in Programs
- A lattice model of secure information flow
- Certification of programs for secure information flow
This page was built for publication: A security flow control algorithm and its denotational semantics correctness proof
