Lower bounds on lengths of checking sequences

Lower bounds on the lengths of checking sequences constructed for testing from Finite State Machine-based specifications are established. These bounds consider the case where a distinguishing sequence is used in forming state recognition and transition verification subsequences and identify the effects of overlapping among such subsequences. Empirical results show that the existing methods for construction of checking sequences provide checking sequences with lengths that are within acceptable distance to these lower bounds.

[1]  Hasan Ural,et al.  Reducing the Lengths of Checking Sequences by Overlapping , 2006, TestCom.

[2]  Alan Hartman,et al.  Using a model-based test generator to test for standard conformance , 2002, IBM Syst. J..

[3]  Gordon Fraser,et al.  Testing with model checkers: a survey , 2009 .

[4]  Alexandre Petrenko,et al.  Generating Checking Sequences for Partial Reduced Finite State Machines , 2008, TestCom/FATES.

[5]  Thierry Jéron,et al.  Integrating formal verification and conformance testing for reactive systems , 2007, IEEE Transactions on Software Engineering.

[6]  Xiaolin Wu,et al.  On Minimizing the Lengths of Checking Sequences , 1997, IEEE Trans. Computers.

[7]  Mark Harman,et al.  Heuristics for fault diagnosis when testing from finite state machines: Research Articles , 2007 .

[8]  Robert M. Hierons.  Verdict functions in testing with a fault domain or test hypotheses , 2009, TSEM.

[9]  Krishan K. Sabnani,et al.  A Protocol Test Generation Procedure , 1988, Comput. Networks.

[10]  Robert M. Hierons,et al.  Reduced Length Checking Sequences , 2002, IEEE Trans. Computers.

[11]  Mark Harman,et al.  Heuristics for fault diagnosis when testing from finite state machines , 2007, Softw. Test. Verification Reliab..

[12]  Krishan K. Sabnani,et al.  Formal methods for generating protocol conformance test sequences , 1990, Proc. IEEE.

[13]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[14]  Sergiu M. Dascalu,et al.  Unit-level test adequacy criteria for visual dataflow languages and a testing methodology , 2008, TSEM.

[15]  David Lee,et al.  Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.

[16]  A. Jefferson Offutt,et al.  Integration testing of object‐oriented components using finite state machines , 2006, Softw. Test. Verification Reliab..

[17]  May Haydar,et al.  Formal Verification of Web Applications Modeled by Communicating Automata , 2004, FORTE.

[18]  Alfred V. Aho,et al.  An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours , 1991, IEEE Trans. Commun..

[19]  Hasan Ural,et al.  Generalizing Redundancy Elimination in Checking Sequences , 2005, ISCIS.

[20]  Alexandre Petrenko,et al.  Confirming configurations in EFSM testing , 2004, IEEE Transactions on Software Engineering.

[21]  M. Ümit Uyar,et al.  A method enabling feasible conformance test sequence generation for EFSM models , 2004, IEEE Transactions on Computers.

[22]  Robert M. Hierons.  Separating sequence overlap for automated test sequence generation , 2006, Automated Software Engineering.

[23]  Hasan Ural,et al.  Optimal length test sequence generation using distinguishing sequences , 1993, TNET.

[24]  F. C. Hennie.  Fault detecting experiments for sequential circuits , 1964, SWCT.

[25]  Robert M. Hierons,et al.  Eliminating Redundant Tests in a Checking Sequence , 2005, TestCom.

[26]  Margus Veanes,et al.  Towards a Tool Environment for Model-Based Testing with AsmL , 2003, FATES.

[27]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[28]  J. Esch.  Prolog to Principles and Methods of Testing Finite State Machines - A Survey , 1996 .

[29]  Arthur Gill,et al.  Introduction to the theory of finite-state machines , 1962 .

[30]  Robert M. Hierons,et al.  Optimizing the length of checking sequences , 2006, IEEE Transactions on Computers.

[31]  Bo Yang,et al.  Protocol conformance test generation using multiple UIO sequences with overlapping , 1990, SIGCOMM '90.

[32]  Sanjoy Paul,et al.  On the generation of minimal-length conformance tests for communication protocols , 1993, TNET.

[33]  Guney Gonenc,et al.  A Method for the Design of Fault Detection Experiments , 1970, IEEE Transactions on Computers.

[34]  Insup Lee,et al.  Data flow testing as model checking , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[35]  Bart Broekman,et al.  Testing Embedded Software , 2002 .

[36]  Robert V. Binder,et al.  Testing Object-Oriented Systems: Models, Patterns, and Tools , 1999 .

[37]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[38]  Robert M. Hierons,et al.  Extending Test Sequence Overlap by Invertibility , 1996, Comput. J..