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.
Type de document :
Communication dans un congrès
ICST 2018 - 11th IEEE Conference on Software Testing, Validation and Verification, Apr 2018, Västerås, Sweden. 2017, 〈10.1109/ICST.2018.00023〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01624988
Contributeur : Thomas Durieux <>
Soumis le : vendredi 27 octobre 2017 - 08:40:00
Dernière modification le : mardi 31 juillet 2018 - 08:55:57

Lien texte intégral

Identifiants

Collections

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. 2017, 〈10.1109/ICST.2018.00023〉. 〈hal-01624988〉

Partager

Métriques

Consultations de la notice

342