Loading...
Please wait, while we are loading the content...
Similar Documents
Issues In Conformance Testing: Multiple Semicontrollable Interfaces (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Fecko, Mariusz A. Sethi, Adarshpal S. Uyar, M. Umit Amer, Paul D. |
| Abstract | In a testing environment, where an IUT communicates with multiple entities, a tester may have differing degrees of controllability on the interactions between these entities and the IUT: directly controllable, semicontrollable, or uncontrollable. In this paper, a graph conversion algorithm is introduced that offers the testability of both the directly and semicontrollable inputs, while avoiding race conditions. Although, for the most general case, the graph conversion results in an exponentially large number of nodes, practical considerations make the converted graph size feasible. Currently, this methodology is being applied to generate tests for MIL-STD 188-220B, which increases the number of testable state transitions from approximately 200 to over 700. |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Multiple Entity Multiple Semicontrollable Interface Race Condition Converted Graph Size Iut Communicates Graph Conversion Algorithm Conformance Testing Large Number General Case Graph Conversion Result Practical Consideration Semicontrollable Input Testable State Transition Testing Environment |
| Content Type | Text |
