Failure Transparency in Stateful Dataflow Systems (Technical Report)
<|reference_start|>Failure Transparency in Stateful Dataflow Systems (Technical Report): Failure transparency enables users to reason about distributed systems at a higher level of abstraction, where complex failure-handling logic is hidden. This is especially true for stateful dataflow systems, which are the backbone of many cloud applications. In particular, this paper focuses on proving failure transparency in Apache Flink, a popular stateful dataflow system. Even though failure transparency is a critical aspect of Apache Flink, to date it has not been formally proven. Showing that the failure transparency mechanism is correct, however, is challenging due to the complexity of the mechanism itself. Nevertheless, this complexity can be effectively hidden behind a failure transparent programming interface. To show that Apache Flink is failure transparent, we model it in small-step operational semantics. Next, we provide a novel definition of failure transparency based on observational explainability, a concept which relates executions according to their observations. Finally, we provide a formal proof of failure transparency for the implementation model; i.e., we prove that the failure-free model correctly abstracts from the failure-related details of the implementation model. We also show liveness of the implementation model under a fair execution assumption. These results are a first step towards a verified stack for stateful dataflow systems.<|reference_end|>
@article{veresov2024failure,
    title={Failure Transparency in Stateful Dataflow Systems (Technical Report)},
    author={Aleksey Veresov (1), Jonas Spenger (1), Paris Carbone (1 and 2),
  Philipp Haller (1) ((1) KTH Royal Institute of Technology, (2) RISE Research
  Institutes of Sweden)},
    journal={arXiv preprint arXiv:2407.06738},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.06738},
    primaryClass={cs.PL cs.DC}
}