Sciweavers

APLAS
2015
ACM

Fault-Tolerant Resource Reasoning

8 years 7 months ago
Fault-Tolerant Resource Reasoning
Abstract. Separation logic has been successful at verifying that programs do not crash due to illegal use of resources. The underlying assumption, however, is that machines do not fail. In practice, machines can fail unpredictably for various reasons, e.g. power loss, corrupting resources. Critical software, e.g. file systems, employ recovery methods to mitigate these effects. We introduce an extension of the Views framework to reason about such methods. We use concurrent separation logic as an instance of the framework to illustrate our reasoning, and explore programs using write-ahead logging, e.g. an ARIES recovery algorithm.
Gian Ntzik, Pedro da Rocha Pinto, Philippa Gardner
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where APLAS
Authors Gian Ntzik, Pedro da Rocha Pinto, Philippa Gardner
Comments (0)