1998
DOI: 10.1007/978-0-387-35394-4_6
|View full text |Cite
|
Sign up to set email alerts
|

Fault-Oriented Test Generation for Multicast Routing Protocol Design

Abstract: Abstract:We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a finite state machine (FSM) model of the protocol and uses a mix of forward and backward search techniques to generate the tests. The output tests include a set of topologies, protocol events and network failures, that lead to violation of protocol correctness and behavioral requirements. We target protocol robustness in specific, and do not attempt to verify other properties in this paper. We appl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1998
1998
2013
2013

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…It is the case for instance in the so-called Fotg approach [11] (Fault Oriented Test Generation): starting from a fault introduced in a protocol specification (like a message loss, or a node crash), it consists in looking (forward) for an error state (a state in which a protocol fails to meet its requirement), and then to search (backward) for a test sequence leading from the initial state to this error state. Even if this approach seems well adapted to fault-tolerant protocols it only deals with single faults (one at a time), and uses a rather simple specification formalism (Finite State Machines).…”
Section: Introductionmentioning
confidence: 99%
“…It is the case for instance in the so-called Fotg approach [11] (Fault Oriented Test Generation): starting from a fault introduced in a protocol specification (like a message loss, or a node crash), it consists in looking (forward) for an error state (a state in which a protocol fails to meet its requirement), and then to search (backward) for a test sequence leading from the initial state to this error state. Even if this approach seems well adapted to fault-tolerant protocols it only deals with single faults (one at a time), and uses a rather simple specification formalism (Finite State Machines).…”
Section: Introductionmentioning
confidence: 99%
“…Robustness testing is a necessary step to complement functional testing, and its role is to guarantee that the software behaviour is acceptable in the presence of internal or external failures, or stressful environmental conditions. In several robustness testing approaches, mostly based on conformance testing [13,16,18], the model used for representing the nominal behaviour is extended to allow the representation of behaviour in the presence of faults. A major limitation associated with such approaches is the fact that the fault model is reduced to that can be represented in the model, and also, that can be applied by a tester.…”
Section: Robustness Testingmentioning
confidence: 99%
“…Most importantly, the seminal work of David Lee and others [1], [15], [23], [24] illustrates the power of formal models in testing. Many authors have subsequently developed models for test case generation, verification, or model-checking of network protocols [3], [5], [7], [17], [29], [19].…”
Section: Introductionmentioning
confidence: 99%