
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rob M. Hierons, Hasan Ural, "Optimizing the Length of Checking Sequences," IEEE Transactions on Computers, vol. 55, no. 5, pp. 618629, May, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.80, author = {Rob M. Hierons and Hasan Ural}, title = {Optimizing the Length of Checking Sequences}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {5}, issn = {00189340}, year = {2006}, pages = {618629}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.80}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimizing the Length of Checking Sequences IS  5 SN  00189340 SP618 EP629 EPD  618629 A1  Rob M. Hierons, A1  Hasan Ural, PY  2006 KW  Finite state machine KW  checking sequence KW  test minimization KW  distinguishing sequence. VL  55 JA  IEEE Transactions on Computers ER   
[1] A.V. Aho, A.T. Dahbura, D. Lee, and M.U. Uyar, “An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours,” Proc. Protocol Specification, Testing, and Verification VIII, pp. 7586, 1988.
[2] B. Broekman and E. Notenboom, Testing Embedded Software. London: AddisonWesley, 2003.
[3] T.S. Chow, “Testing Software Design Modelled by Finite State Machines,” IEEE Trans. Software Eng., vol. 4, pp. 178187, 1978.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability. New York: W.H. Freeman and Company, 1979.
[5] A. Gibbons, Algorithmic Graph Theory. Cambridge Univ. Press, 1985.
[6] G. Gonenc, “A Method for the Design of Fault Detection Experiments,” IEEE Trans. Computers, vol. 19, pp. 551558, 1970.
[7] F.C. Hennie, “FaultDetecting Experiments for Sequential Circuits,” Proc. Fifth Ann. Symp. Switching Circuit Theory and Logical Design, pp. 95110, Nov. 1964.
[8] R.M. Hierons, “Adaptive Testing of a Deterministic Implementation against a Nondetermistic Finite State Machine,” The Computer J., vol. 41, no. 5, pp. 349355, 1998.
[9] R.M. Hierons, “Generating Candidates when Testing a Deterministic Implementation against a NonDeterministic Finite State Machine,” The Computer J., vol. 46, no. 3, pp. 307318, 2003.
[10] R.M. Hierons, “Minimizing the Number of Resets when Testing from a Finite State Machine,” Information Processing Letters, vol. 90, no. 6, pp. 287292, 2004.
[11] R.M. Hierons, “Testing from a NonDeterministic Finite State Machine Using Adaptive State Counting,” IEEE Trans. Computers, vol. 53, no. 10, pp. 13301342, Oct. 2004.
[12] R.M. Hierons and H. Ural, “Reduced Length Checking Sequences,” IEEE Trans. Computers, vol. 51, no. 9, pp. 11111117, Sept. 2002.
[13] M. Holcombe and F. Ipate, Correct Systems: Building a Business Process Solution. SpringerVerlag, 1998.
[14] ITUT, Recommendation Z.500 Framework on Formal Methods in Conformance Testing. Int'l Telecomm. Union, Geneva, 1997.
[15] I. Kohavi and Z. Kohavi, “VariableLength Distinguishing Sequences and Their Application to the Design of FaultDetection Experiments,” IEEE Trans. Computers, vol. 17, no. 8, pp. 792795, Aug. 1968.
[16] Z. Kohavi, Switching and Finite State Automata Theory. New York: McGrawHill, 1978.
[17] G. Luo, A. Das, and G. v. Bochmann, “Generating Tests for Control Portion of SDL Specifications,” Proc. Protocol Test Systems VI, pp. 5166, 1994.
[18] G. Luo, A. Petrenko, and G. v. Bochmann, “Selecting Test Sequences for PartiallySpecified Nondeterministic Finite State Machines,” Proc. Seventh IFIP Workshop Protocol Test Systems, pp. 95110, Nov. 1994.
[19] G.L. Luo, G. v. Bochmann, and A. Petrenko, “Test Selection Based on Communicating Nondeterministic FiniteState Machines Using a Generalized WpMethod,” IEEE Trans. Software Eng., vol. 20, no. 2, pp. 149161, Feb. 1994.
[20] E.P. Moore, “GedankenExperiments,” Automata Studies, C. Shannon and J. McCarthy, eds., Princeton Univ. Press, 1956.
[21] A. Petrenko, S. Boroday, and R. Groz, “Confirming Configurations in EFSM Testing,” IEEE Trans. Software Eng., vol. 30, no. 1, pp. 2942, Jan. 2004.
[22] I. Pomeranz and S.M. Reddy, “Test Generation for Multiple StateTable Faults in FiniteState Machines,” IEEE Trans. Computers, vol. 46, no. 7, pp. 783794, July 1997.
[23] Q.M. Tan, A. Petrenko, and G. v. Bochmann, “Modeling Basic LOTOS by FSMs for Conformance Testing,” Proc. IFIP Protocol Specification, Testing, and Verification XV, pp. 137152, 1995.
[24] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall Int'l Editions, 1996.
[25] H. Ural, K. Saleh, and A. Williams, “Test Generation Based on Control and Data Dependencies within System Specifications in SDL,” Computer Comm., vol. 23, pp. 609627, 2000.
[26] H. Ural, X. Wu, and F. Zhang, “On Minimizing the Lengths of Checking Sequences,” IEEE Trans. Computers, vol. 46, no. 1, pp. 9399, 1997.
[27] G. v. Bochmann, A. Petrenko, O. Bellal, and S. Maguiraga, “Automating the Process of Test Derivation from SDL Specifications,” Proc. SDL Forum '97, 1997.
[28] S.T. Vuong, W.W.L. Chan, and M.R. Ito, “The UIOvMethod for Protocol Test Sequence Generation,” Proc. Second Int'l Workshop Protocol Test Systems, 1989.
[29] M. Yao, A. Petrenko, and G. v. Bochmann, “Conformance Testing of Protocol Machines without Reset,” Proc. Protocol Specification, Testing and Verification XIII (C16), pp. 241256, 1993.
[30] N.V. Yevtushenko, A.V. Lebedev, and A.F. Petrenko, “On Checking Experiments with Nondeterministic Automata,” Automatic Control and Computer Sciences, vol. 6, pp. 8185, 1991.