Publication Details

Boosted Decision Trees for Behaviour Mining of Concurrent Programs

ŠIMKOVÁ, H.; KŘENA, B.; VOJNAR, T.; LETKO, Z.; UR, S.; DUDKA, V.; VOLKOVICH, Z.; AVROS, R. Boosted Decision Trees for Behaviour Mining of Concurrent Programs. Concurrency Computation Practice and Experience, 2017, vol. 29, no. 21, p. 4268-4289. ISSN: 1532-0634.
Czech title
Použití metody rozhodovacích stromů pro dolování v paralelních programech
Type
journal article
Language
English
Authors
Šimková Hana, Mgr. Bc., Ph.D.
Křena Bohuslav, Ing., Ph.D. (DITS)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Letko Zdeněk, Ing., Ph.D. (CM-SFE)
Ur Shmuel
Dudka Vendula, Ing.
Volkovich Zeev (FIT)
Avros Renata (FIT)
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 Computation Practice and Experience, vol. 29, no. 21, ISSN 1532-0634
DOI
10.1002/cpe.4268
UT WoS
000412299700010
EID Scopus
2-s2.0-85028664932
BibTeX 
@article{BUT144486,
  author="Hana {Šimková} and Bohuslav {Křena} and Tomáš {Vojnar} and Zdeněk {Letko} and Shmuel {Ur} and Vendula {Dudka} and Zeev {Volkovich} and Renata {Avros}",
  title="Boosted Decision Trees for Behaviour Mining of Concurrent Programs",
  journal="Concurrency Computation Practice and Experience",
  year="2017",
  volume="29",
  number="21",
  pages="4268--4289",
  doi="10.1002/cpe.4268",
  issn="1532-0634",
  url="http://onlinelibrary.wiley.com/doi/10.1002/cpe.4268/abstract;jsessionid=609089BF58372A54AE23CD0097729CC2.f02t01"
}
Back to top