A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10405839" target="_blank" >RIV/00216208:11320/19:10405839 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1145/3364452.3364457" target="_blank" >https://doi.org/10.1145/3364452.3364457</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3364452.3364457" target="_blank" >10.1145/3364452.3364457</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder

Popis výsledku v původním jazyce

When model checking a multi-threaded program, it is often necessary to enumerate the possible ordering of concurrent events to evaluate the behavior of the program. However, enumerating every possible order of events quickly leads to state-space explosion. Dynamic Partial Order Reduction (DPOR) is a method to dynamically determine a subset of schedules that need to be evaluated to observe all the relevant behavior of a program. A sound implementation of DPOR in Java Pathfinder (JPF) can be tricky without incurring unacceptable amounts of overhead, because JPF does not support subdividing existing transitions. Conservatively inserting choice generators to end transitions at each possible scheduling point causes JPF to save a large amount of state. We present an extension to JPF, which is an efficient implementation of DPOR that attempts to minimize spacial complexity. It handles the directing of the search and uses a simple interface to allow the user to define the set of events to operate on and to determine which of those events are dependent. It keeps its own internal representation of all possible scheduling points without inserting choice generators at each point. It then restarts portions of the search, if necessary, to insert only the needed choice generators.

Název v anglickém jazyce

A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder

Popis výsledku anglicky

When model checking a multi-threaded program, it is often necessary to enumerate the possible ordering of concurrent events to evaluate the behavior of the program. However, enumerating every possible order of events quickly leads to state-space explosion. Dynamic Partial Order Reduction (DPOR) is a method to dynamically determine a subset of schedules that need to be evaluated to observe all the relevant behavior of a program. A sound implementation of DPOR in Java Pathfinder (JPF) can be tricky without incurring unacceptable amounts of overhead, because JPF does not support subdividing existing transitions. Conservatively inserting choice generators to end transitions at each possible scheduling point causes JPF to save a large amount of state. We present an extension to JPF, which is an efficient implementation of DPOR that attempts to minimize spacial complexity. It handles the directing of the search and uses a simple interface to allow the user to define the set of events to operate on and to determine which of those events are dependent. It keeps its own internal representation of all possible scheduling points without inserting choice generators at each point. It then restarts portions of the search, if necessary, to insert only the needed choice generators.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2019

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

ACM SIGSOFT Software Engineering Notes

ISBN

—

ISSN

0163-5948

e-ISSN

—

Počet stran výsledku

5

Strana od-do

1-5

Název nakladatele

ACM

Místo vydání

New York, USA

Místo konání akce

San Diego, USA

Datum konání akce

11. 11. 2019

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

WRD - Celosvětová akce

Kód UT WoS článku

—