Publication Details

Boosted Decision Trees for Behaviour Mining of Concurrent Programs

AVROS Renata, DUDKA Vendula, KŘENA Bohuslav, LETKO Zdeněk, PLUHÁČKOVÁ Hana, UR Shmuel, VOJNAR Tomáš and VOLKOVICH Zeev. Boosted Decision Trees for Behaviour Mining of Concurrent Programs. Concurrency and Computation: Practice and Experience, vol. 29, no. 21, pp. 4268-4289. ISSN 1532-0634. Available from: http://onlinelibrary.wiley.com/doi/10.1002/cpe.4268/abstract;jsessionid=609089BF58372A54AE23CD0097729CC2.f02t01
Czech title
Použití metody rozhodovacích stromů pro dolování v paralelních programech
Type
journal article
Language
english
Authors
Avros Renata, Dr. (ORTB)
Dudka Vendula, Ing. (DITS FIT BUT)
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT)
Letko Zdeněk, Ing., Ph.D. (DITS FIT BUT)
Pluháčková Hana, Mgr. Bc. (DITS FIT BUT)
Ur Shmuel (IBM)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
Volkovich Zeev, prof. (ORTB)
URL
Keywords
AdaBoost,automated testing,concurrent programmes,data mining,genetic algorithms,noise injection
Abstract
Testing of concurrent programmes is difficult since the scheduling nondeterminism requires one to test a huge number of different thread interleavings. Moreover, repeated test executions that are performed in the same environment will typically examine similar interleavings only. One possible way how to deal with this problem is to use the noise injection approach, which influences the scheduling by injecting various kinds of noise (delays, context switches, etc) into the common thread behaviour. However, for noise injection to be efficient, one has to choose suitable noise injection heuristics from among the many existing ones as well as to suitably choose values of their various parameters, which is not easy. In this paper, we propose a novel way how to deal with the problem of choosing suitable noise injection heuristics and suitable values of their parameters (as well as suitable values of parameters of the programmes being tested themselves). Here, by suitable, we mean such settings that maximize chances of meeting a given testing goal (such as, eg, maximizing coverage of rare behaviours and thus maximizing chances to find rarely occurring concurrency-related bugs). Our approach is, in particular, based on using data mining in the context of noise-based testing to get more insight about the importance of the different heuristics in a particular testing context as well as to improve fully automated noise-based testing (in combination with both random as well as genetically optimized noise setting).
Published
2017
Pages
4268-4289
Journal
Concurrency and Computation: Practice and Experience, vol. 29, no. 21, ISSN 1532-0634
Publisher
WILEY
DOI
BibTeX
@ARTICLE{FITPUB11569,
   author = "Renata Avros and Vendula Dudka and Bohuslav K\v{r}ena and Zden\v{e}k Letko and Hana Pluh\'{a}\v{c}kov\'{a} and Shmuel Ur and Tom\'{a}\v{s} Vojnar and Zeev Volkovich",
   title = "Boosted Decision Trees for Behaviour Mining of Concurrent Programs",
   pages = "4268--4289",
   journal = "Concurrency and Computation: Practice and Experience",
   volume = 29,
   number = 21,
   year = 2017,
   ISSN = "1532-0634",
   doi = "10.1002/cpe.4268",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/11569"
}
Back to top