Paper Info
Title
A study of mutable checkpointing and related algorithms.
Abstract
Mutable Checkpointing algorithms (MC), [7], [8], [9], stand for snapshot algorithms that take checkpoints of processes with causally induced dependencies to the initiating process, only. They classify as coordinated snapshot algorithms with communication induced checkpointing. To specify and verify such algorithms formally, we introduce a formal framework in which their operational semantics can easily be expressed. Within this framework correctness of the algorithms follows from an invariant which explains how snapshots are incrementally built up. For MC and the related blocking queue algorithms of [26], [27] some adaptations are required as they take a partial snapshot, only. However, both can be proven in the given framework and in this way we equip them with a direct, constructive consistency proof.
Year
DOI
Venue
2018
10.1016/j.scico.2017.03.009
Science of Computer Programming
Keywords
Field
DocType
Snapshot,Checkpointing,Consistency,Formal verification,Distributed computing
Operational semantics,Programming language,Constructive,Computer science,Correctness,Queue,Algorithm,Theoretical computer science,Invariant (mathematics),Snapshot (computer storage),Formal verification
Journal
Volume
ISSN
Citations 
160
0167-6423
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
A. Kiehn124922.96
Deepanker Aggarwal200.34