Testing from a nondeterministic finite state machine using adaptive state counting

被引：69
|
作者：
Hierons, RM [1 ]
机构：
[1] Brunel Univ, Dept Informat Syst & Comp, Uxbridge UB8 3PH, Middx, England
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2004年 / 53卷 / 10期
基金：
英国工程与自然科学研究理事会;
关键词：
software engineering; software/program verification; testing and debugging; nondeterministic finite state machine; adaptive testing; state counting;
D O I：
10.1109/TC.2004.85
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point.
引用
收藏
页码：1330 / 1342
页数：13
相关论文
共 13 条
  • [1] REFINING SPECIFICATIONS IN ADAPTIVE TESTING OF NONDETERMINISTIC FINITE STATE MACHINES
    Petrenko, Alexandre
    Yevtushenko, Nina
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2009, 6 (01): : 99 - 114
  • [2] On adaptive experiments for nondeterministic finite state machines
    Kushik, Natalia
    El-Fakih, Khaled
    Yevtushenko, Nina
    Cavalli, Ana R.
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2016, 18 (03) : 251 - 264
  • [3] On adaptive experiments for nondeterministic finite state machines
    Natalia Kushik
    Khaled El-Fakih
    Nina Yevtushenko
    Ana R. Cavalli
    International Journal on Software Tools for Technology Transfer, 2016, 18 : 251 - 264
  • [4] Learning and Adaptive Testing of Nondeterministic State Machines
    Petrenko, Alexandre
    Avellaneda, Florent
    2019 IEEE 19TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY (QRS 2019), 2019, : 362 - 373
  • [5] NONDETERMINISTIC STATE MACHINES IN PROTOCOL CONFORMANCE TESTING
    PETRENKO, A
    YEVTUSHENKO, N
    LEBEDEV, A
    DAS, A
    PROTOCOL TEST SYSTEMS, VI, 1994, 19 : 363 - 378
  • [6] Distinguishing tests for nondeterministic finite state machines
    Boroday, SY
    TESTING OF COMMUNICATING SYSTEMS, 1998, : 101 - 107
  • [7] Minimizing the cost of fault location when testing from a finite state machine
    Hierons, RM
    COMPUTER COMMUNICATIONS, 1999, 22 (02) : 120 - 127
  • [8] Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machines
    Zhang, F
    Cheung, TY
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2003, 29 (01) : 1 - 14
  • [9] Heuristics for deriving distinguishing experiments of nondeterministic finite state machines
    El-Fakih, Khaled
    Haddad, Abdul Rahim
    Aleb, Nassima
    Yevtushenko, Nina
    APPLIED SOFT COMPUTING, 2016, 49 : 1175 - 1184
  • [10] Parallel Implementation for Deriving Preset Distinguishing Experiments of Nondeterministic Finite State Machines
    Haddad, Abdul Rahim
    El-Fakih, Khaled
    Barlas, Gerassimos
    2017 7TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO), 2017,
12