| C.-J. Wang and M.T. Liu, "Generating Test Cases for EFSM with Given Fault Model," Proc. IEEE INFOCOM'93 Conf., pp. 774-781, 1993. |
.... The experience obtained in generating tests for 188220 suggests that to successfully test today s complex protocols by using formal methods, an ideal test generation tool should support multiple test generation techniques [45] They can range from Postman tours [1] or fault oriented tests [78] [80] for mid size protocols when the number of states ranges on the order of thousands, to guided random walk approaches [43] 81] for larger protocols when the 20 number of states ranges in the tens of thousands. The state explosion problem has been a major issue for generating FSM models out of ....
....ranges on the order of thousands, to guided random walk approaches [43] 81] for larger protocols when the 20 number of states ranges in the tens of thousands. The state explosion problem has been a major issue for generating FSM models out of EFSM representations of protocols [15] 56] 79] [80]. One common procedure for converting EFSMs into FSMs simultaneously performs reachability analysis and online minimization [15] 44] this conversion is based on combining equivalent states [58] using bisimulation equivalence [51] Another approach proposes the elimination of inconsistencies in ....
C. J. Wang and M. T. Liu. Generating test cases for EFSM with given fault models. Proc. IEEE INFOCOM, 774--781, 1993.
.... The experience obtained in generating tests for 188 220 suggests that to successfully test today s complex protocols by using formal methods, an ideal test generation tool should support multiple test generation techniques [49] They can range from Postman tours [2] or fault oriented tests [83, 85] for mid size protocols when the number of states ranges on the order of thousands, to guided random walk approaches [47, 86] for larger protocols when the number of states ranges in the tens of thousands. The state explosion problem has been a major issue for generating FSM models out of EFSM ....
....the number of states ranges on the order of thousands, to guided random walk approaches [47, 86] for larger protocols when the number of states ranges in the tens of thousands. The state explosion problem has been a major issue for generating FSM models out of EFSM representations of protocols [17, 60, 84, 85]. One common procedure for converting EFSMs into FSMs simultaneously performs reachability analysis and online minimization [17, 48] this conversion is based on combining equivalent states [63] using bisimulation equivalence [55] Another approach proposes the elimination of inconsistencies in ....
C. J. Wang and M. T. Liu. Generating test cases for EFSM with given fault models. Proc. IEEE INFOCOM, 774--781, 1993.
.... The experience obtained in generating tests for 188 220 suggests that to successfully test today s complex protocols by using formal methods, an ideal test generation tool should support multiple test generation techniques [50] They can range from Postman tours [2] or fault oriented tests [84,86] for mid size protocols when the number of states ranges on the order of thousands, to guided random walk approaches [48,87] for larger protocols when the number of states ranges in the tens of thousands. The state explosion problem has been a major issue for generating FSM models out of EFSM ....
....the number of states ranges on the order of thousands, to guided random walk approaches [48,87] for larger protocols when the number of states ranges in the tens of thousands. The state explosion problem has been a major issue for generating FSM models out of EFSM representations of protocols [19,60,85,86]. One common procedure for converting EFSMs into FSMs simultaneously performs reachability analysis and online minimization [19,49] this conversion is based on combining equivalent states [63] using bisimulation equivalence [56] Another approach proposes the elimination of inconsistencies in ....
C. J. Wang and M. T. Liu. Generating test cases for EFSM with given fault models. Proc. IEEE INFOCOM, 774--781, 1993.
....in k ###(where counter # ##) Therefore, before the exit transition can be taken, transition Q## # Q## must be executed 10 times. An alternative to separate control and transition operation testing and combined control and data flow testing is the fault based testing technique proposed by Wang [WL93] In this technique, an explicit fault model of the system is constructed as a mutation of the original EFSM. Test sequences are then generated that are guaranteed to distinguish between the correct specification and the mutant. Although, leaving the fault model to be specified by the tester ....
....the statespace of reachability analysis [God90] and the notion of semi independent finite state machines [Hie97b] was suggested as a means of avoiding concurrent reachability analysis altogether. Similar intuition can be found in the combined control and data flow testing techniques [MP92, CZ93, WL93] where test sequences are targeted at detecting particular faults in the data operations rather than exhaustively testing all combinations of data values. The techniques did not address the issue of testing communicating EFSMs that share data interactions. This must be addressed when generating ....
Chang-Jia Wang and Ming T. Liu. Generating test cases for EFSMs with given fault models. In IEEE INFOCOM'93, pages 774--781, 1993.
.... The experience obtained in generating tests for 188 220 suggests that to successfully test today s complex protocols by using formal methods, 18 an ideal test generation tool should support multiple test generation techniques [40] They can range from Postman tours [1] or fault oriented tests [66, 69] for mid size protocols (i.e. the number of states in the order of thousands) to guided random walk approaches [38, 70] for large protocols (i.e. the number of states larger than tens of thousands) State explosion problem has been a major issue for generating FSM models out of EFSM ....
.... (i.e. the number of states in the order of thousands) to guided random walk approaches [38, 70] for large protocols (i.e. the number of states larger than tens of thousands) State explosion problem has been a major issue for generating FSM models out of EFSM representations of protocols [16, 50, 68, 69]. One common procedure for converting EFSMs into FSMs simultaneously performs reachability analysis and online minimization [16, 39] this conversion is based on combining equivalent states [51] by using the notion of bisimulation equivalence [46] Another approach proposes the elimination of ....
C. J. Wang and M. T. Liu. Generating test cases for EFSM with given fault models. In Proc. IEEE INFOCOM: Int'l Conf. Comput. Commun., pp. 774--781, 1993.
....each mutant CEFSM with a single EFSM that models the behavior of the mutant CEFSM within a restricted scope. We rely on a model checker to eventually determine a most powerful confirming sequence. Thus, we follow a trend in the area to use a model checker engine to derive tests, see e.g. [WaLi93], CaSc96] HLS96] ABM98] KJG99] JM99] At the same time, the novelty of our approach is that nondeterministic mutants are used to reduce the state space needed to model faults mutations, while covering more potential faults. Using the ObjectGeode environment, we demonstrated that the ....
Wang C.--J., and Liu M. T., Generating test cases for EFSM with given fault model. Proceedings of the IEEE INFOCOM'93; 1993; San Francisco, USA.
....an arbitrary finite set of configurations of a known REFSM. Informally speaking, the set represents all possible suspicious configurations to which any implementation may go due to potential faults. It may be treated as a special fault model for a given transition or a fault function used in [8, 9]. Definition 3.7. Given configuration c and a configuration set C of an REFSM M, a parameterized input sequence a is said to confirm c in the set C if a separates c from every cC distinguishable from c. q We use distinguishing machines to derive configuration confirming sequences. To this end, ....
C.-J. Wang and M. T. Liu, Generating test cases for EFSM with given fault model, Proceedings of the IEEE INFOCOM'93, 1993, pp. 774-781. Confirming Configurations in EFSM 19
.... The experience obtained in generating tests for 188 220 suggests that to successfully test today s complex protocols by using formal methods, an ideal test generation tool should support multiple test generation techniques [41] They can range from Postman tours [1] or fault oriented tests [70,72] for mid size protocols (i.e. the number of states in the order of thousands) to guided random walk approaches [39,73] for large protocols (i.e. the number of states larger than tens of thousands) State explosion problem has been a major issue for generating FSM models out of EFSM ....
.... (i.e. the number of states in the order of thousands) to guided random walk approaches [39,73] for large protocols (i.e. the number of states larger than tens of thousands) State explosion problem has been a major issue for generating FSM models out of EFSM representations of protocols [15,52,71,72]. One common procedure for converting EFSMs into FSMs simultaneously performs reachability analysis and online minimization [15,40] this conversion is based on combining equivalent states [54] by using the notion of bisimulation equivalence [47] Another approach proposes the elimination of ....
C.J. Wang, M.T. Liu, Generating test cases for EFSM with given fault models, in: Proc. IEEE INFOCOM, 1993, pp. 774--781.
....there does not yet exist any such standardized fault model. Much work has been done on fault based testing for finite state models, see for example, SiLe89] BDD91] PeYe92] Ural92] PBD93] and 3 extended finite state machines (EFSMs) GrPe90] FaPe90] PrGu91] MiPa92] ChZh93] [WaLi93]. In software testing, the relation between input domains and execution paths has been extensively studied and fault models for the domain boundaries have been used for test suite development [JeWe94] The finite state models have been extensively used in conformance testing of communication ....
C.-J. Wang and M. T. Liu, "Generating Test Cases for EFSM with Given Fault Models", Proc. of the IEEE INFOCOM'93, pp. 774-781.
.... The experience obtained in generating tests for 188 220 suggests that to successfully test today s complex protocols by using formal methods, an ideal test generation tool should support multiple test generation techniques [40] They can range 25 from Postman tours [1] or fault oriented tests [67,70] for mid size protocols (i.e. the number of states in the order of thousands) to guided random walk approaches [38,71] for large protocols (i.e. the number of states larger than tens of thousands) State explosion problem has been a major issue for generating FSM models out of EFSM ....
.... (i.e. the number of states in the order of thousands) to guided random walk approaches [38,71] for large protocols (i.e. the number of states larger than tens of thousands) State explosion problem has been a major issue for generating FSM models out of EFSM representations of protocols [16,50,69,70]. One common procedure for converting EFSMs into FSMs simultaneously performs reachability analysis and online minimization [16,39] this conversion is based on combining equivalent states [52] by using the notion of bisimulation equivalence [46] Another approach proposes the elimination of ....
C. J. Wang and M. T. Liu. Generating test cases for EFSM with given fault models. In Proc. IEEE Int'l Conf. Comput. Commun. (INFOCOM), pp. 774--781, 1993.
No context found.
C.-J. Wang and M.T. Liu, "Generating Test Cases for EFSM with Given Fault Model," Proc. IEEE INFOCOM'93 Conf., pp. 774-781, 1993.
No context found.
C.-J. Wang and M. T. Liu, "Generating test cases for EFSM with given fault models," Proc. INFOCOM, pp. 774-781, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC