Verifying Confidentiality Under Nondeterminism for Storage Systems
Storage systems must often store confidential data for their users. It is important to ensure that confidentiality of the stored data is maintained in the presence of bugs and malicious adversaries. This thesis tackles this problem using formal verification, a technique that involves proving a softw...
Main Author: | Ileri, Atalay Mert |
---|---|
Other Authors: | Kaashoek, M. Frans |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2023
|
Online Access: | https://hdl.handle.net/1721.1/150298 |
Similar Items
-
Mechanisms with costly knowledge
by: Ileri, Atalay M. (Atalay Mert)
Published: (2016) -
Nondeterminism in Logics of Programs
by: Harel, David, et al.
Published: (2023) -
Unbounded nondeterminism in CSP
by: Roscoe, A, et al.
Published: (1989) -
Verifying a high-performance crash-safe file system using a tree specification
by: Chen, Haogang, et al.
Published: (2021) -
Omnisemantics: Smoother Handling of Nondeterminism
by: Chargu?raud, Arthur, et al.
Published: (2023)