Search
Now showing items 1-6 of 6
Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
(2017-09)
Many methods are proposed for the construction of distinguishing test cases (DTCs) based on a specification given in the form of a Finite State Machine (FSM). In FSM-based testing, we have a black-box FSM Implementation ...
Efficient Algorithms for Constructing Preset Distinguishing Sequences for Nondeterministic Finite State Machines
(2016-06)
Derivation of input sequences for distinguishing states of a finite state machine (FSM) specification is well studied in the context of FSM-based functional testing. We present three heuristics for the derivation of ...
On Studying the Effectiveness of Extended Finite State Machine Based Test Selection Criteria
(2015-07)
Automatic test derivation from formal specifications offers a rigorous discipline to functional conformance testing. In various application domains, such as communication protocols and other reactive systems, the specification ...
Fault Coverage and Diagnosis of Protocols and Systems Modeled As Extended Finite State Machines
(2015-01)
Automatic test derivation from formal specifications offers a rigorous discipline to functional conformance testing. In various application domains, such as communication protocols and other reactive systems, the specification ...
Parallel Algorithms for Distinguishing Nondeterministic Finite State Machines
(2015-02)
Many methods are used for the development of experiments and conformance tests based on the specification given in the form Finite State Machines (FSMs). In FSM-based testing, we have an FSM or a black-box Implementation ...
Parallel Implementations for Eliminating Finite State Machine Mutants
(2017-05)
In this thesis, the mutants’ elimination problem considered in finite state machine (FSM) based mutation testing, fault diagnosis, and in the assessment of the effectiveness of test suites is targeted. Given a test suite ...