On the testability of SDL specifications

The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specification in order to eliminate or reduce the infeasible path problem. This approach is divided into two phases in order to aid generality. First the SDL specification is rewritten to create a normal form extended finite state machine (NF-EFSM). This NF-EFSM is then expanded in order to produce a state machine in which the test criterion may be satisfied using paths that are known to be feasible. The expansion process is guaranteed to terminate. Where the expansion process may lead to an excessively large state machine, this process may be terminated early and feasible paths added. The approach is illustrated through being applied to the Initiator process of the Inres protocol.

[1]  Christophe Meudec,et al.  Automatic generation of software test cases from formal specifications , 1998 .

[2]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[3]  Sang Bae Lee,et al.  Test case generation of a protocol by a fault coverage analysis , 1998, Proceedings Twelfth International Conference on Information Networking (ICOIN-12).

[4]  Ali Y. Duale,et al.  Resolving inconsistencies in EFSM-modeled specifications , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[5]  Mirko Conrad,et al.  Test case design based on Z and the classification-tree method , 1997, First IEEE International Conference on Formal Engineering Methods.

[6]  Hasan Ural,et al.  Test generation based on control and data dependencies within system specifications in SDL , 2000, Comput. Commun..

[7]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[8]  Cliff B. Jones,et al.  Systematic software development using VDM (2. ed.) , 1990, Prentice Hall International Series in Computer Science.

[9]  Robert M. Hierons,et al.  Expanding an extended finite state machine to aid testability , 2002, Proceedings 26th Annual International Computer Software and Applications.

[10]  Robert M. Hierons.  Testing from a Z Specification , 1997, Softw. Test. Verification Reliab..

[11]  Itu-T.  Specification and Description Language (SDL) , 1999 .

[12]  Elaine J. Weyuker,et al.  Selecting Software Test Data Using Data Flow Information , 1985, IEEE Transactions on Software Engineering.

[13]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[14]  Jeremy Dick,et al.  Automating the Generation and Sequencing of Test Cases from Model-Based Specifications , 1993, FME.

[15]  J. Michael Spivey,et al.  Understanding Z : A specification language and its formal semantics , 1985, Cambridge tracts in theoretical computer science.

[16]  P. T. Barry,et al.  Abstract syntax notation-one (ASN.1) , 1992 .

[17]  Dieter Hogrefe,et al.  Towards the industrial use of validation techniques and automatic test generation methods for SDL specifications , 1997, SDL Forum.

[18]  O. Henniger,et al.  Transformation of Estelle modules aiming at test case generation , 1996 .

[19]  Robert M. Hierons,et al.  Testing a system specified using Statecharts and Z , 2001, Inf. Softw. Technol..