A Test Design Methodology for Protocol Testing

Sarikaya, Behçet; Bochmann, Gregor von; Cerny, Eduard

doi:10.1109/tse.1987.233197

Cited by 113 publications

(34 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Many test generation approaches for systems modeled as EFSMs appear in the literature [16] , [17] , [18] , [36], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57]. A major portion of the previous work can be categorised to three main groups:…”

Section: Related Workmentioning

confidence: 99%

“…There are also other approaches that apply program testing techniques to test from an EFSM [18,55]. An approach which employs software dataflow testing to derive a test sequence from EFSM models is presented in [18].…”

Section: Related Workmentioning

confidence: 99%

“…However, the approach essentially defines a test criterion rather than showing how test cases can be produced to satisfy a test criterion. Work has also generated test sequences from an EFSM by employing functional program testing [55]. The approach converted the specification written in Estelle [59] into a simpler form in order to construct control and data flow graphs to be used in test sequence derivation.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Kalaji

Hierons

Swift

2011

Information and Software Technology

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Kalaji

Hierons

Swift

2011

Information and Software Technology

View full text Add to dashboard Cite

“…Test case generation from EFSM, however, is still challenging. Several researchers have considered the control and data flow separately [2], [3], [4]. For the data part, the test selection is based on data-flow criteria developed for structural testing, since the notation used for the description of predicates and actions of an EFSM is similar to high-level programming languages.…”

Section: Introductionmentioning

confidence: 99%

MOST: A Multi-objective Search-Based Testing from EFSM

Yano

Martins

Sousa

2011

2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops

View full text Add to dashboard Cite

Abstract-This paper introduces a multi-objective evolutionary approach to test case generation from extended finite state machines (EFSM), named MOST. Testing from an (E)FSM generally involves executing various transition paths, until a given coverage criterion (e.g. cover all transitions) is met. As traditional test generation methods from FSM only consider the control aspects, they can produce many infeasible paths when applied to EFSMs, due to conflicts in guard conditions along a path. In order to avoid the infeasible path generation, we propose an approach that obtains feasible paths dynamically, instead of performing static reachability analysis as usual for FSM-based methods. Previous works have treated EFSM test case generation as a mono-objective optimization problem. Our approach takes two objectives into account that are the coverage criterion and the solution length. In this way, it is not necessary to establish in advance the test case size as earlier approaches. MOST constructs a Pareto set approximation, i.e., a group of optimal solutions, which allows the test team to select the solutions that represent a good trade-off between both objectives. The paper shows empirical studies to illustrate the benefits of the approach and comparing the results with the ones obtained in a related work.

show abstract

“…There are a number of test design techniques [9,10] which algorithmically generate test cases from deterministic finite state machine (FSM) models of protocols. However, generating readily usable complete test cases from other FDTs, such as LOTOS, Estelle, and SDL, is more difficult, and research until now has produced only a partial solution [11,12]. The limited research that has been reported so far deals only with the local single-layer (LS) test architecture.…”

Section: Introductionmentioning

confidence: 99%

Test case verification by model checking

Naik

Sarikaya

1993

Form Method Syst Des

View full text Add to dashboard Cite

Abstract. Verification of a test case for testing the conformance of protocol implementations against the formal description of the protocol involves verifying three aspects of the test case: expected input/output test behavior, test verdicts, and the test purpose. We model the safety and liveness properties of a test case using branching time temporal logic. There are four types of safety properties: transmission safety, reception safety, synchronization safety, and verdict safety. We model a test purpose as a liveness property and give a set of notations to formally specify a test purpose. All these properties expressed as temporal formulas are verified using model checking on an extended state machine graph representing the composed behavior of a test case and protocol specification. This methodology is shown to be effective in finding errors in manually developed conformance test suites.

show abstract

A Test Design Methodology for Protocol Testing

Cited by 113 publications

References 4 publications

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

MOST: A Multi-objective Search-Based Testing from EFSM

Test case verification by model checking

Contact Info

Product

Resources

About