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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shuetsu Hanata

dblp:00/2608 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

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

Software engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Software testing · 56% Empirical software engineering · 44%

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

TopicWeightPapersLastEvidence papers
Empirical software engineering
software metrics
0.011989
An Error Complexity Model for Software Reliability Measurement · ICSE 1989
Software testing
software reliability
0.011989
An Error Complexity Model for Software Reliability Measurement · ICSE 1989
Software testing › software reliability
reliability assessment
0.011989
An Error Complexity Model for Software Reliability Measurement · ICSE 1989

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

statistical evaluation · 0.0error complexity modeling · 0.0
YearPublicationVenuePosition
1989 Statistically-based program size estimation
abstract
A model for estimating program size, before coding of the program begins, on the basis of the complexity of the software is presented. The complexity of the software is computed from program logic charts with the Halstead metrics. The relationships between the complexity of the software and program size are then statistically analyzed by taking hypothesized environmental factors, such as program categories, into consideration. Results of an experiment show that, of the Halstead metrics, N/sub 1/ is the most significant and reasonable as a metric for computing the complexity of the software from program logic charts. The results also show that the model based on this metric is more reliable than the conventional size estimation method.>
Muneo Takahashi, Takeshi Miyake, Shuetsu Hanata
COMPSAC3
1989 An Error Complexity Model for Software Reliability Measurement
abstract
Many simple software errors are found in earlier software test phases.The ratio of complex errors to simple errors gradually increases with continual testing.This paper describes a software reliability model called the Error Complexity Model.In this model, errors are classified by error complexity which is a measure of error detectability.The number of remaining software errors is estimated from the ratio of complex to simple errors and the number of discovered errors.New criteria for error complexity classification are proposed.The model is evaluated and compared with existing models using actual error data.
Yutaka Nakagawa, Shuetsu Hanata
ICSE2