Communication Protocol System Testing – from Fundamental Theory to Test Automation and Software Tools

Advanced the theory of testing of finite state machines and solved several fundamental problems in the area that had been open for decades (with Yannakakis): state identification (distinguishing sequence), state verification (UIO sequence), and checking experiments (checking sequences of polynomial length).

D. Lee and M. Yannakakis, “Principles and Methods of Testing Finite State Machines - A Survey”, Proceedings of The IEEE, Vol. 84, No. 8, August 1996, pp. 1090-1123

D. Lee and M. Yannakakis, “Testing Finite State Machines: State Identification and Verification”, IEEE Trans. on Computers, Vol. 43, No. 3, March 1994, pp. 306-320. An extended abstract with a title “Testing Finite State Machines” appeared in Proc. 23rd Annual ACM Symposium Theory of Computing, May 1991, pp. 476-485

M. Yannakakis and D. Lee, “Testing Finite State Machines: Fault Detection”,J. Computer Science and Systems, Vol. 50, No. 2, 1995, pp. 209-227

K.-Q. Li and D. Lee, Fault Detection of Hierarchical Networks with Probabilistic Testing Algorithms, TestCom, 2005

D. Lee, D. Chen, R. Hao, R. E. Miller, J. Wu, and X. Yin, “A Formal Approach for Passive Testing of Protocol Data Portions”, Proc. ICNP’2002

D. Lee and M. Yannakakis, “Closed Partition Lattice and Machine Decomposition”, IEEE Trans. on Computers, Vol. 51, No. 2, 2001, pp. 216-228

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”, IEEE Transactions on Communications, Vol. 39, No. 11, 1991, pp. 1604-1615. An earlier version with a same title appeared in Proc. IFIP WG 6.18th International Symposium on Protocol Specification, Testing, and Verification, June 1988