Selecting Software Test Data Using Data Flow Information
IEEE Transactions on Software Engineering
Functional program testing and analysis
Functional program testing and analysis
The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Test Design Methodology for Protocol Testing
IEEE Transactions on Software Engineering
Test sequence selection based on static data flow analysis
Computer Communications
An introduction to Estelle: a specification language for distributed systems
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
An interpreter for LOTOS, a specification language for distributed systems
Software—Practice & Experience
An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
The CCITT-specification and description language SDL
Computer Networks and ISDN Systems
Strategic Testing Environment with Formal Description Techniques
IEEE Transactions on Computers - Special issue on protocol engineering
A Well-Defined Estelle Specification for the Automatic Test Generation
IEEE Transactions on Computers - Special issue on protocol engineering
Test Generation from LOTOS Specifications
IEEE Transactions on Computers - Special issue on protocol engineering
The CO-OP Method for Compositional Derivation of Conformance Testers
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
IEEE Transactions on Software Engineering
Conformance evaluation methodology and protocol testing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
This paper presents a method to generate, analyse and represent test cases from protocol specification. The language of temporal ordering specification (LOTOS) is mapped into an extended finite state machine (EFSM). Test cases are generated from EFSM. The generated test cases are modelled as a dependence graph. Predicate slices are used to identify infeasible test cases that must be eliminated. Redundant assignments and predicates in all the feasible test cases are removed by reducing the test case dependence graph. The reduced test case dependence graph is adapted for a local single-layer (LS) architecture. The reduced test cases for the LS architecture are enhanced to represent the tester's behaviour. The dynamic behaviour of the test cases is represented in the form of control graphs by inverting the events, assigning verdicts to the events in the enhanced dependence graph.