FSM-Based Testing from User Defined Faults Adapted to Incremental and Mutation Testing 1; Programming and Computer Software; Vol. 38, iss. 4
| Parent link: | Programming and Computer Software: scientific journal.— , 1975- Vol. 38, iss. 4.— 2012.— [P. 201-209] |
|---|---|
| Müşterek Yazar: | |
| Diğer Yazarlar: | , , , |
| Özet: | Title screen We study the problem of deriving a test suite with guaranteed fault coverage from a given finite state machine specification with respect to some given user defined faults. We consider the case when an implementation under test can have more states than its specification while user defined faults are implemented in an arbitrary way. We show that our approach can be used for FSM-based incremental and mutation testing and correspondingly we investigate cases that can be used for reducing length of obtained test suites. In some cases, worst-case length of obtained test suite becomes polynomial. Experiments show significant gains is using our approach in comparison to testing the whole specification. Режим доступа: по договору с организацией-держателем ресурса |
| Dil: | İngilizce |
| Baskı/Yayın Bilgisi: |
2012
|
| Konular: | |
| Online Erişim: | http://dx.doi.org/10.1134/S0361768812040019 http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2380 |
| Materyal Türü: | Elektronik Kitap Bölümü |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=641319 |
MARC
| LEADER | 00000naa0a2200000 4500 | ||
|---|---|---|---|
| 001 | 641319 | ||
| 005 | 20250326153141.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\6219 | ||
| 035 | |a RU\TPU\network\6205 | ||
| 090 | |a 641319 | ||
| 100 | |a 20150515d2012 k||y0rusy50 ba | ||
| 101 | 0 | |a eng | |
| 102 | |a RU | ||
| 135 | |a drcn ---uucaa | ||
| 181 | 0 | |a i | |
| 182 | 0 | |a b | |
| 200 | 1 | |a FSM-Based Testing from User Defined Faults Adapted to Incremental and Mutation Testing 1 |f Kh. El-Fakih [et al.] | |
| 203 | |a Text |c electronic | ||
| 300 | |a Title screen | ||
| 320 | |a [References: p. 208-209 (28 tit.)] | ||
| 330 | |a We study the problem of deriving a test suite with guaranteed fault coverage from a given finite state machine specification with respect to some given user defined faults. We consider the case when an implementation under test can have more states than its specification while user defined faults are implemented in an arbitrary way. We show that our approach can be used for FSM-based incremental and mutation testing and correspondingly we investigate cases that can be used for reducing length of obtained test suites. In some cases, worst-case length of obtained test suite becomes polynomial. Experiments show significant gains is using our approach in comparison to testing the whole specification. | ||
| 333 | |a Режим доступа: по договору с организацией-держателем ресурса | ||
| 461 | |t Programming and Computer Software |o scientific journal |d 1975- | ||
| 463 | |t Vol. 38, iss. 4 |v [P. 201-209] |d 2012 | ||
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a труды учёных ТПУ | |
| 701 | 1 | |a El-Fakih |b Kh. |g Khaled | |
| 701 | 1 | |a Dorofeeva |b M. Yu. |c specialist in the field of informatics and computer technology |c programmer of Tomsk Polytechnic University, Candidate of technical sciences |c Director of the Center for organization and monitoring of educational activity |f 1979- |g Margarita Yurievna |3 (RuTPU)RU\TPU\pers\34591 |9 17953 | |
| 701 | 1 | |a Yevtushenko |b N. |g Nina | |
| 701 | 1 | |a Bochmann |b G. V. | |
| 712 | 0 | 2 | |a Национальный исследовательский Томский политехнический университет (ТПУ) |b Институт электронного обучения (ИнЭО) |b Кафедра технологий и педагогики электронного обучения (ТПЭО) |3 (RuTPU)RU\TPU\col\20233 |
| 801 | 2 | |a RU |b 63413507 |c 20150519 |g RCR | |
| 856 | 4 | |u http://dx.doi.org/10.1134/S0361768812040019 | |
| 856 | 4 | |u http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2380 | |
| 942 | |c CF | ||