Paper Info
Title
Computing Complete Test Graphs for Hierarchical Systems
Abstract
Conformance testing focuses on checking whether an implementation under test (IUT) behaves according to its specification. Typically, testers are interested in performing targeted tests that exercise certain features of the IUT. This intention is formalized as a test purpose. The tester needs a "strategy" to reach the goal specified by the test purpose. Also, for a particular test case, the strategy should tell the tester whether the IUT has passed, failed, or deviated from the test purpose. In [8] Jéron and Morel show how to compute, for a given finite state machine specification and a test purpose automaton, a complete test graph (CTG) which represents all test strategies. In this paper, we consider the case when the specification is a hierarchical state machine and show how to compute a hierarchical CTG which preserves the hierarchical structure of the specification. We also propose an algorithm for an online test oracle which avoids a space overhead associated with the CTG.
Year
DOI
Venue
2006
10.1109/SEFM.2006.13
SEFM
Keywords
Field
DocType
complete test graph,test purpose automaton,hierarchical state machine,hierarchical ctg,online test oracle,targeted test,hierarchical systems,particular test case,computing complete test graphs,finite state machine specification,test purpose,test strategy,finite state machines,formal specification,conformance testing,graph theory,finite state machine,hierarchical system,state machine
Graph theory,Programming language,Computer science,Automaton,Oracle,Formal specification,Theoretical computer science,Conformance testing,Finite-state machine,Test case,Test strategy
Conference
ISSN
ISBN
Citations 
1551-0255
0-7695-2678-0
0
PageRank 
References 
Authors
0.34
6
2
Name
Order
Citations
PageRank
Deepak D'souza123917.90
Madhu Gopinatha200.34