Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

W. T. Chen

dblp:92/2793 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
3 papers
Software testing · 81% Program analysis · 19%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Mathematical optimization · 50%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
test input generation
0.021976
On the Automated Generation of Program Test Data · IEEE Trans. Software Eng. 1976
On the Automated Generation of Program Test Data (Abstract) · ICSE 1976
Program analysis
symbolic execution
0.011976
On the Automated Generation of Program Test Data · IEEE Trans. Software Eng. 1976
Software testing
systematic testing
0.011975
Optimal Placement of Software Monitors Aiding Systematic Testing · IEEE Trans. Software Eng. 1975
Software testing › test coverage
path coverage
0.011976
On the Automated Generation of Program Test Data · IEEE Trans. Software Eng. 1976
Software testing › test adequacy
testing criteria
0.011976
On the Automated Generation of Program Test Data · IEEE Trans. Software Eng. 1976
Graph algorithms and graph theory
graph theory
0.011975
Optimal Placement of Software Monitors Aiding Systematic Testing · IEEE Trans. Software Eng. 1975
Mathematical optimization
optimization
0.011975
Optimal Placement of Software Monitors Aiding Systematic Testing · IEEE Trans. Software Eng. 1975

Methods — techniques the papers use, named apart from their topics

symbolic execution · 0.0program graph analysis · 0.0graph-theoretic formulation · 0.0graph theoretic formulation · 0.0
YearPublicationVenuePosition
1982 TH-NET: A Microprocessor-Based Local Network
W. T. Chen, H. C. Wang, J. W. Tsai, J. Y. Wei
ICDCS1
1976 On the Automated Generation of Program Test Data (Abstract)
C. V. Ramamoorthy, Siu-Bun F. Ho, W. T. Chen
ICSE3
1976 On the Automated Generation of Program Test Data
abstract
Software validation through testing will continue to be a very important tool for ensuring correctness of large scale software systems. Automation of testing tools can greatly enhance their power and reduce testing cost. In this paper, techniques for automated test data generation are discussed. Given a program graph, a set of paths are identified to satisfy some given testing criteria. When a path or a program segment is specified, symbolic execution is used for generating input constraints which define a set of inputs for executing this path or segment. Problems encountered in symbolic execution are discussed. A new approach for resolving array reference ambiguities and a procedure for generating test inputs satisfying input constraints are proposed. References to arrays are recorded in a table. during symbolic execution and ambiguities are resolved when test data are generated to evaluate the subscript expressions. The implementation of a test data generator for Fortran programs incorporating these techniques is also described.
C. V. Ramamoorthy, Siu-Bun F. Ho, W. T. Chen
IEEE Trans. Software Eng.3
1975 Optimal Placement of Software Monitors Aiding Systematic Testing
abstract
The usefulness of software monitors in testing large programs is discussed. Several types of testing strategies based on the use of monitors are surveyed. Since there is a computational overhead involved in employing monitors, attempts are made to minimize the number of monitors employed. This optimisation problem is formulated and analyzed in graph theoretic terms. Implementation aspects are considered through both discussion and examples.
C. V. Ramamoorthy, K. H. (Kane) Kim, W. T. Chen
IEEE Trans. Software Eng.3