J-ReCoVer: Java Reducer Commutativity Verifier
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU134967" target="_blank" >RIV/00216305:26230/19:PU134967 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-34175-6_18" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-34175-6_18</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-34175-6_18" target="_blank" >10.1007/978-3-030-34175-6_18</a>
Alternative languages
Result language
angličtina
Original language name
J-ReCoVer: Java Reducer Commutativity Verifier
Original language description
The MapReduce framework for data-parallel computation was first proposed by Google and later implemented in the Apache Hadoop project. Under the MapReduce framework, a reducer computes output values from a sequence of input values transmitted over the network. Due to non-determinism in data transmission, the order in which input values arrive at the reducer is not fixed. In relation to this, the commutativity problem of reducers asks if the output of a reducer is independent of the order of its inputs. Indeed, there are several advantages for a reducer to be commutative, e.g., the verification problem of a MapReduce program can be reduced to the problem of verifying a sequential program. We present the tool J-ReCoVer (Java Reducer Commutativity Verifier) that implements effective heuristics for reducer commutativity analysis. J-ReCoVer is the first tool that is specialised in checking reducer commutativity. Our experimental results over 118 benchmark examples collected from open repositories are very positive; J-ReCoVer correctly handles over 97% of them.
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
<a href="/en/project/GA17-12465S" target="_blank" >GA17-12465S: Verification and Bug Hunting for Advanced Software</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
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
Proceedings of 17th Asian Symposium on Programming Languages and Systems (APLAS)
ISBN
978-3-030-34174-9
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
357-366
Publisher name
Springer International Publishing
Place of publication
Cham
Event location
Bali
Event date
Dec 1, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000611530200018