Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Exhaustive Exploration of the Failure-oblivious Computing Search Space
Univ Lille, Lille, France.;INRIA, Le Chesnay, France..
Ecole Polytech, Palaiseau, France..
Univ Lille, Lille, France.;INRIA, Le Chesnay, France..
KTH, School of Electrical Engineering and Computer Science (EECS), Software and Computer systems, SCS.
Show others and affiliations
2018 (English)In: 2018 IEEE 11TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST), IEEE Press, 2018, p. 139-149Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE Press, 2018. p. 139-149
Series
IEEE International Conference on Software Testing Verification and Validation, ISSN 2381-2834
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:kth:diva-231652DOI: 10.1109/ICST.2018.00023ISI: 000435006300013Scopus ID: 2-s2.0-85048441080ISBN: 978-1-5386-5012-7 (print)OAI: oai:DiVA.org:kth-231652DiVA, id: diva2:1245426
Conference
11th IEEE International Conference on Software Testing, Verification and Validation (ICST), APR 09-13, 2018, Vasteras, SWEDEN
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Note

QC 20180905

Available from: 2018-09-05 Created: 2018-09-05 Last updated: 2019-03-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Baudry, BenoitMonperrus, Martin

Search in DiVA

By author/editor
Baudry, BenoitMonperrus, Martin
By organisation
Software and Computer systems, SCSTheoretical Computer Science, TCS
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 280 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf