Fault-tolerant resource reasoning
File(s)aplas2015.pdf (348.39 KB)
Accepted version
Author(s)
Ntzik, G
da Rocha Pinto, P
Gardner, PA
Type
Conference Paper
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.
Date Issued
2015-12-09
Date Acceptance
2015-08-18
Citation
Programming Languages and Systems, 2015, 9458, pp.169-188
ISBN
978-3-319-26528-5
ISSN
0302-9743
Publisher
Springer International Publishing
Start Page
169
End Page
188
Journal / Book Title
Programming Languages and Systems
Volume
9458
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-26529-2_10
Sponsor
Engineering & Physical Science Research Council (E
Engineering & Physical Science Research Council (E
Grant Number
EP/H008373/1
EP/K008528/1
Source
13th Asian Symposium on Programming Languages and Systems
Subjects
Artificial Intelligence & Image Processing
08 Information And Computing Sciences
Publication Status
Published
Start Date
2015-11-30
Finish Date
2015-12-02
Coverage Spatial
Pohang, Korea