Yayınlanmış 1 Ocak 2017
| Sürüm v1
Konferans bildirisi
Açık
Decreasing the Complexity of Deriving Test Suites against Nondeterministic Finite State Machines
- 1. Univ Caddesi, Sabanci Univ, 27 Orhanli Tuzla, TR-34956 Istanbul, Turkey
- 2. Univ Paris Saclay, CNRS, Telecom SudParis, SAMOVAR, 9 Rue Charles Fourier, F-91000 Evry, France
- 3. Tomsk State Univ, 36 Lenin Str, Tomsk 634050, Russia
Açıklama
The paper presents a Finite State Machine (FSM) based approach for deriving tests with reduced complexity, under the White Box testing assumption where all the faulty implementations are explicitly enumerated. The specification and implementation FSMs are assumed to be initialized, i.e., each possibly partial and (non-observable) nondeterministic FSM has a reliable reset. The proposed technique is illustrated by the application to a communication protocol.
Dosyalar
bib-4e32c2bf-02ed-4e77-aa72-3c4f3c4f023c.txt
Dosyalar
(223 Bytes)
| Ad | Boyut | Hepisini indir |
|---|---|---|
|
md5:7de6d3c5cd47f7f559edf60e934bbc49
|
223 Bytes | Ön İzleme İndir |