Fractional resources in unbounded separation logic
Many separation logics support fractional permissions to distinguish between read and write
access to a heap location, for instance, to allow concurrent reads while enforcing exclusive …
access to a heap location, for instance, to allow concurrent reads while enforcing exclusive …
The functional essence of imperative binary search trees
A Lorenzen, D Leijen, W Swierstra… - Proceedings of the ACM on …, 2024 - dl.acm.org
Algorithms on restructuring binary search trees are typically presented in imperative
pseudocode. Understandably so, as their performance relies on in-place execution, rather …
pseudocode. Understandably so, as their performance relies on in-place execution, rather …
Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic
Array-based encodings of tree structures are often preferable to linked or abstract data type-
based representations for efficiency reasons. Compared to the more traditional encodings …
based representations for efficiency reasons. Compared to the more traditional encodings …
Automated and foundational verification of low-level programs
MJ Sammler - 2023 - publikationen.sulb.uni-saarland.de
Formal verification is a promising technique to ensure the reliability of low-level programs
like operating systems and hypervisors, since it can show the absence of whole classes of …
like operating systems and hypervisors, since it can show the absence of whole classes of …
[PDF][PDF] Rooting for Efficiency
Array-based encodings of tree structures are often preferable to linked or abstract data type-
based representations for efficiency reasons. Compared to the more traditional encodings …
based representations for efficiency reasons. Compared to the more traditional encodings …