The following pages link to Tsong Yueh Chen (Q209302):
Displaying 18 items.
- On the fixpoints of nondeterministic recursive definitions (Q1059391) (← links)
- Formalization of equivalence of recursively defined functions (Q1144373) (← links)
- Formalization of properties of nondeterministic recursive definitions (Q1148668) (← links)
- Dividing strategies for the optimization of a test suite (Q1350110) (← links)
- A more general sufficient condition for partition testing to be better than random testing (Q1351584) (← links)
- On the structural properties of the set of fixpoints for nondeterministic recursive definitions (Q1915506) (← links)
- (Q2771789) (← links)
- A Cost-Effective Random Testing Method for Programs with Non-Numeric Inputs (Q2985134) (← links)
- Randomized Quasi-Random Testing (Q2985447) (← links)
- (Q3045404) (← links)
- AIDA–A dynamic data flow anomaly detection system for pascal programs (Q3746865) (← links)
- Formalization of correctness of recursive definitions (Q3874192) (← links)
- On the relationship between computed functions and fixpoints of nondeterministic recursive definitions (Q3947102) (← links)
- (Q4435391) (← links)
- Adaptive Partition Testing (Q4626995) (← links)
- On the Completeness of a Test Suite Reduction Strategy (Q4935304) (← links)
- Test case selection with and without replacement (Q5946282) (← links)
- The universal safeness of test allocation strategies for partition testing (Q5946283) (← links)
