On the testability of SDL specifications

Authors:
R. M. Hierons;T.-H. Kim;H. Ural
Affiliations:
Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex UB8 3PH, United Kingdom;School of Computer and Software Engineering, Kumoh National Institute of Technology, 188 Sinpyeong-dong, Gumi-si, Gyeongbuk 730-701, South Korea;School of Information Technology and Engineering, Faculty of Engineering, University of Ottawa, 800 King Edward Avenue, Ottawa, Ont., Canada K1N 6N5
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 7
Cited 7

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Understanding Z: a specification language and its formal semantics

Understanding Z: a specification language and its formal semantics
Systematic software development using VDM (2nd ed.)

Systematic software development using VDM (2nd ed.)
The Z notation: a reference manual

The Z notation: a reference manual
Expanding an Extended Finite State Machine to aid Testability

COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Automating the Generation and Sequencing of Test Cases from Model-Based Specifications

FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Test generation based on control and data dependencies within system specifications in SDL

Computer Communications

Generating feasible input sequences for extended finite state machines (EFSMs) using genetic algorithms

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Synthesis of test purpose directed reactive planning tester for nondeterministic systems

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Using formal specifications to support testing

ACM Computing Surveys (CSUR)
Canonical finite state machines for distributed systems

Theoretical Computer Science
Specification coverage for testing in circus

UTP'10 Proceedings of the Third international conference on Unifying theories of programming
An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Information and Software Technology
Integration testing through reusing representative unit test cases for high-confidence medical software

Computers in Biology and Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.