Healing Data Races On-The-Fly

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F07%3APU70824" target="_blank" >RIV/00216305:26230/07:PU70824 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Healing Data Races On-The-Fly

Popis výsledku v původním jazyce

Testing of concurrent software is extremely difficult. Despite all the progress in the testing and verification technology, concurrent bugs, the most common of which are deadlocks and races, make it to the field. This paper describes a set of techniques,implemented in a tool called ConTest, allowing concurrent programs to self-heal at run-time. <p>Concurrent bugs have the very desirable property for healing that some of the interleaving produce correct results while in others bugs manifest. Healing concurrency problems is about limiting, or changing the probability of interleaving, such that bugs will be seen less.&nbsp; When healing concurrent programs, if a deadlock does not result from limiting the interleaving, we are sure that the result of the healed program could have been in the original program and therefore no new functional bug has been introduced.</p> <p>In this initial work which deals with different types of data races, we suggest three types of healing mechanisms:&nbsp;

Název v anglickém jazyce

Healing Data Races On-The-Fly

Popis výsledku anglicky

Testing of concurrent software is extremely difficult. Despite all the progress in the testing and verification technology, concurrent bugs, the most common of which are deadlocks and races, make it to the field. This paper describes a set of techniques,implemented in a tool called ConTest, allowing concurrent programs to self-heal at run-time. <p>Concurrent bugs have the very desirable property for healing that some of the interleaving produce correct results while in others bugs manifest. Healing concurrency problems is about limiting, or changing the probability of interleaving, such that bugs will be seen less.&nbsp; When healing concurrent programs, if a deadlock does not result from limiting the interleaving, we are sure that the result of the healed program could have been in the original program and therefore no new functional bug has been introduced.</p> <p>In this initial work which deals with different types of data races, we suggest three types of healing mechanisms:&nbsp;

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2007

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of 5th International Workshop on Parallel and Distributed Systems: Testing and Debugging Modelling - PADTAD'07

ISBN

978-1-59593-734-6

ISSN

—

e-ISSN

—

Počet stran výsledku

11

Strana od-do

54-64

Název nakladatele

Association for Computing Machinery

Místo vydání

London

Místo konání akce

London

Datum konání akce

9. 7. 2007

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—