Result Details
Boosted Decision Trees for Behaviour Mining of Concurrent Programs
ŠIMKOVÁ, H.; LETKO, Z.; KŘENA, B.; VOJNAR, T.; DUDKA, V.; AVROS, R.; UR, S.; VOLKOVICH, Z. Boosted Decision Trees for Behaviour Mining of Concurrent Programs. Proceedings of MEMICS'14. Brno: NOVPRESS s.r.o., 2014. p. 15-27. ISBN: 978-80-214-5022-6.
Type
conference paper
Language
English
Authors
Šimková Hana, Mgr. Bc., Ph.D., DITS (FIT)
Letko Zdeněk, Ing., Ph.D., DITS (FIT)
Křena Bohuslav, Ing., Ph.D., DITS (FIT)
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
Dudka Vendula, Ing., FIT (FIT)
Avros Renata
Ur Shmuel
Volkovich Zeev
Letko Zdeněk, Ing., Ph.D., DITS (FIT)
Křena Bohuslav, Ing., Ph.D., DITS (FIT)
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
Dudka Vendula, Ing., FIT (FIT)
Avros Renata
Ur Shmuel
Volkovich Zeev
Abstract
Testing of concurrent programs is difficult since the scheduling non-determinism requires one to test a huge number of different thread interleavings. Moreover, a simple repetition of test executions will typically examine similar interleavings only. One popular way how to deal with this
problem is to use the noise injection approach, which is, however, parameterized with many parameters whose suitable values are difficult to find. In this paper,
we propose a novel application of classification-based data mining for this purpose. Our approach can identify which test and noise parameters are the most influential for a given program and a given testing goal and which values (or
ranges of values) of these parameters are suitable for meeting this goal. We present experiments that show that our approach can indeed fully automatically
improve noise-based testing of particular programs with a~particular testing goal. At the same time, we use it to obtain new general insights into noise-based testing as well.
Keywords
Testing, noise injection, classification, AdaBoost, multi-threaded programs
Published
2014
Pages
15–27
Proceedings
Proceedings of MEMICS'14
Conference
MEMICS'14 -- 9th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-214-5022-6
Publisher
NOVPRESS s.r.o.
Place
Brno
BibTeX
@inproceedings{BUT111631,
author="Hana {Šimková} and Zdeněk {Letko} and Bohuslav {Křena} and Tomáš {Vojnar} and Vendula {Dudka} and Renata {Avros} and Shmuel {Ur} and Zeev {Volkovich}",
title="Boosted Decision Trees for Behaviour Mining of Concurrent Programs",
booktitle="Proceedings of MEMICS'14",
year="2014",
pages="15--27",
publisher="NOVPRESS s.r.o.",
address="Brno",
isbn="978-80-214-5022-6"
}
Projects
Intelligent Testing and Analysis of Concurrent Software, MŠMT, KONTAKT II (2011-2017), LH13265, start: 2013-04-01, end: 2015-03-31, completed
Spolehlivost a bezpečnost v IT, BUT, Vnitřní projekty VUT, FIT-S-14-2486, start: 2014-01-01, end: 2016-12-31, completed
Support of Interdisciplinary Excellence Research Teams Establishment at BUT, EU, OP VK - Oblast podpory 2.3 - Lidské zdroje ve VaV, EE2.3.30.0005, start: 2012-07-01, end: 2015-06-30, completed
Verifikace a optimalizace počítačových systémů, BUT, Vnitřní projekty VUT, FIT-S-12-1, start: 2012-01-01, end: 2014-12-31, completed
Spolehlivost a bezpečnost v IT, BUT, Vnitřní projekty VUT, FIT-S-14-2486, start: 2014-01-01, end: 2016-12-31, completed
Support of Interdisciplinary Excellence Research Teams Establishment at BUT, EU, OP VK - Oblast podpory 2.3 - Lidské zdroje ve VaV, EE2.3.30.0005, start: 2012-07-01, end: 2015-06-30, completed
Verifikace a optimalizace počítačových systémů, BUT, Vnitřní projekty VUT, FIT-S-12-1, start: 2012-01-01, end: 2014-12-31, completed
Research groups
Departments