A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
ACM SIGSOFT Software Engineering Notes
ISBN
—
ISSN
0163-5948
e-ISSN
—
Number of pages
5
Pages from-to
1-5
Publisher name
ACM
Place of publication
New York, USA
Event location
San Diego, USA
Event date
Nov 11, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—