Eliminating redundant tests in a checking sequence

Authors:
Jessica Chen;Robert M. Hierons;Hasan Ural;Husnu Yenigun
Affiliations:
School of Computer Science, University of Windsor, Windsor, Ontario, Canada;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UK;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada;Faculty of Engineering and Natural Sciences, Sabanci University, Tuzla, Istanbul, Turkey
Venue:
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Year:
2005

Citing 15
Cited 12

Testing finite state machines

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A note on approximation of the vertex cover and feedback vertex set problems—unified approach

Information Processing Letters
Computer networks (3rd ed.)

Computer networks (3rd ed.)
On Minimizing the Lengths of Checking Sequences

IEEE Transactions on Computers
Test Generation for Multiple State-Table Faults in Finite-State Machines

IEEE Transactions on Computers
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Testing Finite-State Machines: State Identification and Verification

IEEE Transactions on Computers
Reduced Length Checking Sequences

IEEE Transactions on Computers
Modeling basic LOTOS by FSMs for conformance testing

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Generating Tests for Control Portion of SDL Specifications

Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
A Method for the Design of Fault Detection Experiments

IEEE Transactions on Computers
Variable-Length Distinguishing Sequences and Their Application to the Design of Fault-Detection Experiments

IEEE Transactions on Computers
Fault detecting experiments for sequential circuits

SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Test generation based on control and data dependencies within system specifications in SDL

Computer Communications

Reformulation of the generation of conformance testing sequences to the asymmetric travelling salesman problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Ant colony optimisation for generation of conformance testing sequences using a characterising set

ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
A bipartite graph matching approach to generate optimal test sequences for protocol conformance testing

ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Using adaptive distinguishing sequences in checking sequence constructions

Proceedings of the 2008 ACM symposium on Applied computing
Generating Checking Sequences for Partial Reduced Finite State Machines

TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
An Approach to Testing with Embedded Context Using Model Checker

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Exploring alternatives for transition verification

Journal of Systems and Software
Reducing test sequence length using invertible sequences

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Reducing the lengths of checking sequences by overlapping

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Generalizing redundancy elimination in checking sequences

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
New state-recognition patterns for conformance testing of finite state machine implementations

Computer Standards & Interfaces
On "Exploring alternatives for transition verification"

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Under certain well–defined conditions, determining the correctness of a system under test (SUT) is based on a checking sequence generated from a finite state machine (FSM) specification of the SUT. When there is a distinguishing sequence for the FSM, an efficient checking sequence may be produced from the elements of a set Eα′ of α′-sequences that verify subsets of states and the elements of a set EC of subsequences that test the individual transitions. An optimization algorithm may be used in order to produce a shortest checking sequence by connecting the elements of Eα′ and EC using transitions drawn from an acyclic set. Previous work did not consider whether some transition tests may be omitted from EC. This paper investigates the problem of eliminating subsequences from EC for those transitions that correspond to the last transitions traversed when a distinguishing sequence is applied in an α′–sequence to obtain a further reduction in the length of a checking sequence.