@article{tai_lei_2002, title={A test generation strategy for pairwise testing}, volume={28}, number={1}, journal={IEEE Transactions on Software Engineering}, author={Tai, K. C. and Lei, Y.}, year={2002}, pages={109–111} }
 @article{koppol_carver_tai_2002, title={Incremental integration testing of concurrent programs}, volume={28}, ISSN={["1939-3520"]}, DOI={10.1109/TSE.2002.1010062}, abstractNote={We present a method for selecting test sequences for concurrent programs from labeled transitions systems (LTS). A common approach to selecting test sequences from a set of LTSs is to derive a global LTS, called the reachability graph, and then force deterministic program executions according to paths selected from the graph. However, using a reachability graph for test path selection introduces a state explosion problem. To overcome this problem, a reduced graph can be generated using incremental reachability analysis, which consists of repeatedly generating a reachability graph for a subset of LTSs, reducing this graph, and using the reduced graph in place of the original LTSs. Unfortunately, existing incremental reachability analysis techniques generate reduced graphs with insufficient information for deterministic testing. We present an incremental approach to testing concurrent programs. Incremental testing consists of incremental reachability analysis for test path selection and deterministic testing for test execution. We define a new type of reachability graph for incremental analysis, called an annotated labeled transition system (ALTS). An ALTS is an LTS annotated with information necessary for deterministic testing. We propose practical coverage criteria for selecting tests paths from an ALTS and present an ALTS reduction algorithm. The results of several case studies are reported.}, number={6}, journal={IEEE TRANSACTIONS ON SOFTWARE ENGINEERING}, author={Koppol, PV and Carver, RH and Tai, KC}, year={2002}, month={Jun}, pages={607–623} }
 @inbook{karacali_tai_2000, title={Model checking based on simultaneous reachability analysis}, volume={1885}, ISBN={3540410309}, booktitle={SPIN model checking and software verification: 7th International SPIN Workshop, Stanford, CA, USA, August 30-Sept. 1, 2000}, publisher={Berlin; New York: Springer}, author={Karacali, B. and Tai, K. C.}, year={2000}, pages={34–53} }
 @article{tai_daniels_1999, title={Interclass test order for object-oriented software}, volume={12}, number={4}, journal={Journal of Object-oriented Programming}, author={Tai, K. C. and Daniels, F. J.}, year={1999}, pages={18-} }
 @article{tai_young_1998, title={Synchronizable test sequences of finite state machines}, volume={30}, ISSN={["0169-7552"]}, DOI={10.1016/S0169-7552(98)00013-0}, abstractNote={The finite state machine (FSM) model is commonly used for specifying communication protocols and other types of distributed systems. For an FSM with multiple ports, multiple testers are needed, but the synchronization between inputs from different testers becomes a problem. A synchronizable test sequence of an FSM is a test sequence for which the synchronization problem either does not exist or can be solved by communication between testers. In this paper, we consider two testing strategies for an FSM: port-based testing, which does not allow testers for the FSM to communicate with each other, and group-based testing, which divides ports of the FSM into mutually disjoint groups and allows testers for ports in the same group to communicate with each other. For each type of testing, we define a necessary and sufficient condition under which a test sequence of an FSM is synchronizable and show how to generate a set of testers according to a given test sequence. We also discuss test sequence generation and fault detection, and present the results of empirical studies.}, number={12}, journal={COMPUTER NETWORKS AND ISDN SYSTEMS}, author={Tai, KC and Young, YC}, year={1998}, month={Jul}, pages={1111–1134} }
 @article{carver_tai_1998, title={Use of sequencing constraints for specification-based testing of concurrent programs}, volume={24}, ISSN={["0098-5589"]}, DOI={10.1109/32.689403}, abstractNote={This paper presents and evaluates a specification-based methodology for testing concurrent programs. This methodology requires sequencing constraints, which specify restrictions on the allowed sequences of synchronization events. Sequencing constraints for a concurrent program can be derived from the program's formal or informal specification. Details of the proposed testing methodology based on the use of Constraints on Succeeding and Preceding Events (CSPE) are given. How to achieve coverage and detect violations of CSPE constraints for a concurrent program, according to deterministic and nondeterministic testing of this program, are described. A coverage criterion for CSPE-based testing is defined and analyzed. The results of empirical studies of CSPE-based testing for four concurrent problems are reported. These results indicate that the use of sequencing constraints for specification-based testing of concurrent programs is a promising approach.}, number={6}, journal={IEEE TRANSACTIONS ON SOFTWARE ENGINEERING}, author={Carver, RH and Tai, KC}, year={1998}, month={Jun}, pages={471–490} }