Name
Affiliation
Papers
KUO-CHUNG TAI
N Carolina State Univ, Dept Comp Sci, Raleigh, NC 27695 USA
51
Collaborators
Citations 
PageRank 
27
1274
132.89
Referers 
Referees 
References 
2116
419
407
Search Limit
1001000
Title
Citations
PageRank
Year
Blocking-based Simultaneous Reachability Analysis of Asynchronous Message-passing Programs40.472002
Incremental integration testing of concurrent programs301.402002
Efficient reachability testing of asynchronous message-passing programs201.072002
A New Approach To Checking Sequence Generation for Finite State Machines20.402002
On Godefroid's Stateless Search Technique for Testing Concurrent Programs10.352001
Model Checking Based on Simultaneous Reachability Analysis90.662000
Deadlock Detection of EFSMs Using Simultaneous Reachability Analysis30.452000
Deadlock Analysis of Client/Server Programs20.432000
Deadlock Analysis of Synchronous Message-Passing Programs70.681999
Automated Test Sequence Generation Using Sequencing Constraints for Concurrent Programs100.821999
In-parameter-order: a test generation strategy for pairwise testing1459.141998
Synchronizable test sequences of finite state machines351.461998
Reachability Testing of Asynchronous Message-Passing Programs80.661997
Test order for inter-class integration testing of object-oriented software251.121997
Theory of Fault-Based Predicate Testing for Computer Programs583.221996
An incremental approach to structural testing of concurrent software191.691996
Automatic test-generation for predicates [software testing]90.791996
Test Generation For Boolean Expressions261.941995
A Specification-Based Methology for Testing Concurrent Programs101.401995
Reachability Testing: An Approach To Testing Concurrent Software401.911995
Evaluation of a predicate-based software testing strategy131.431994
Empirical studies of predicate-based software testing221.531994
Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs121.211994
Use of Sequencing Constraints for Specifying, Testing, and Debugging Concurrent Programs40.571994
Predicate-based test generation for computer programs232.891993
An incremental approach to reachability analysis of distributed programs161.361993
Fault-based test generation for cause-effect graphs20.531993
Static analysis of concurrent software for deriving synchronization constraints70.761991
Replay and testing for concurrent programs8910.561991
Debugging concurrent Ada programs by deterministic execution9310.181991
A Course on Software Enigneering for Concurrent Systems00.341988
A comparison of computed chaining to predictors00.341986
Reproducible Testing of Concurrent Programs Based on Shared Variables245.771986
A program complexity metric based on data flow information in control graphs151.281984
Visualizing algorithms and processes with the aid of a computer41.681983
The Practicality of Text Signatures for Accelerating String Searching119.021982
Comments on parameter passing techniques in programming languages20.441982
Experience with porting the Portable C Compiler10.371982
Computed chaining—A hybrid of direct chaining and open addressing42.941981
An introduction to computed chaining00.341980
Comments on the suggested implementation of tasking facilities in the "rationale for the design of the ADA programming language"10.361980
Program Testing Complexity and Test Criteria182.581980
Predictors Of Context-Free Grammars50.571980
Locally minimum-distance correction of syntax errors in programming languages10.341980
On the implementation of parsing tables00.341979
Constant folding within an expression by semantic attributes00.341979
On program testing criteria00.341979
The Tree-to-Tree Correction Problem41837.201979
Syntactic Error Correction in Programming Languages185.111978
The recovery of parsing configurations for LR(1) parsers51.171977
  • 1
  • 2