Non-interference through determinism

DOI10.1007/3-540-58618-0_55zbMath1477.68063OpenAlexW2948700248MaRDI QIDQ826053

J. C. P. Woodcock, A. W. Roscoe, Lasse Wulf

Publication date: 20 December 2021

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7308

zbMATH Keywords

determinismprocess algebrasecurityformal methodsautomatic verificationnon-interference

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computer security (68M25)

Related Items (7)

Rule formats for compositional non-interference properties ⋮ Scheduler-Independent Declassification ⋮ Threat scenarios as a means to formally develop secure systems ⋮ Preservation of probabilistic information flow under refinement ⋮ May Testing, Non-interference, and Compositionality ⋮ The security pi-calculus and non-interference ⋮ Unwinding Possibilistic Security Properties

This page was built for publication: Non-interference through determinism