Exhaustive Exploration of the Failure-oblivious Computing Search Space

Abstract : High-availability of software systems requires automated handling of crashes in presence of errors. Failure-oblivious computing is one technique that aims to achieve high availability. We note that failure-obliviousness has not been studied in depth yet, and there is very few study that helps understand why failure-oblivious techniques work. In order to make failure-oblivious computing to have an impact in practice, we need to deeply understand failure-oblivious behaviors in software. In this paper, we study, design and perform an experiment that analyzes the size and the diversity of the failure-oblivious behaviors. Our experiment consists of exhaustively computing the search space of 16 field failures of large-scale open-source Java software. The outcome of this experiment is a much better understanding of what really happens when failure-oblivious computing is used, and this opens new promising research directions.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-01624988
Contributor : Thomas Durieux <>
Submitted on : Friday, October 27, 2017 - 8:40:00 AM
Last modification on : Friday, March 22, 2019 - 1:34:43 AM

Links full text

Identifiers

Citation

Thomas Durieux, Youssef Hamadi, Zhongxing Yu, Benoit Baudry, Martin Monperrus. Exhaustive Exploration of the Failure-oblivious Computing Search Space. ICST 2018 - 11th IEEE Conference on Software Testing, Validation and Verification, Apr 2018, Västerås, Sweden. ⟨10.1109/ICST.2018.00023⟩. ⟨hal-01624988⟩

Share

Metrics

Record views

526