Sciweavers

169 search results - page 1 / 34
» Reduced Length Checking Sequences
Sort
View
TC
2002
13 years 4 months ago
Reduced Length Checking Sequences
-- Here the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of t...
Robert M. Hierons, Hasan Ural
PTS
2008
80views Hardware» more  PTS 2008»
13 years 6 months ago
Generating Checking Sequences for Partial Reduced Finite State Machines
The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is pro...
Adenilso da Silva Simão, Alexandre Petrenko
ISCIS
2005
Springer
13 years 10 months ago
Generalizing Redundancy Elimination in Checking Sequences
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...
ISCIS
2009
Springer
13 years 11 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
ASE
2006
123views more  ASE 2006»
13 years 4 months ago
Separating sequence overlap for automated test sequence generation
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...
Robert M. Hierons