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

D. Lee and M. Yannakakis, “On-line Minimization of Transition Systems”, Proc. 24th Annual ACM Symposium on Theory of Computing, May 1992, pp. 264-274

D. Lee and R. Hao, “Test Sequence Selection”, Proc. PSTV-FORTE’2001

D. Lee and R. Hao, “Efficient Algorithms for Test Sequence Selection”, Proc. FATE’2001 (invited paper, keynote)

T. F. LaPorta, D. Lee, Y. -J. Lin, and M. Yannakakis, “Protocol Feature Interactions”, Proc. FORTE/PSTV, 1998
[Formalized protocol feature interaction problem and provided efficient algorithms for the feature interaction detection.]

D. Lee and M. Yannakakis, “Optimization Problems from Feature Testing of Communication Protocols”, Proc. ICNP, October 1996, pp. 66-75

M. Yannakakis and D. Lee, “Testing Finite State Machines”, Proc. CSL, November 1998 (invited paper)

M. Yannakakis and D. Lee, “An Efficient Algorithm for Minimizing Real-time Transition Systems”, J. of Formal Methods in System Design, 1996. An earlier version appeared in Proc. CAV, 1993, pp. 210-224

D. Lee, K. K. Sabnani, D. M. Kristol and S. Paul, “Conformance Testing of Protocols Specified as Communicating Finite State Machines - a Guided Random Walk Based Approach”, IEEE Trans. on Communications, Vol. 44, No. 5, 1996, pp. 631-640. An earlier version with a title “Conformance Testing of Protocols Specified as Communicating FSMs” appeared in IEEE INFOCOM'93, March 30 - April 1, 1993, pp. 115-127