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

Albert L. Baker

dblp:86/6821 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2000
—ORCID · none

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

Software engineering, systems software and programming languages · 9 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 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
2 papers
Empirical software engineering · 77% Software maintenance and evolution · 23%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Empirical software engineering
software metrics
0.021980
A Comparison of Measures of Control Flow Complexity · IEEE Trans. Software Eng. 1980
The Use of Software Science in Evaluating Modularity Concepts · IEEE Trans. Software Eng. 1979
Empirical software engineering › software metrics
control flow complexity
0.011980
A Comparison of Measures of Control Flow Complexity · IEEE Trans. Software Eng. 1980
Software maintenance and evolution
software modularity
0.011979
The Use of Software Science in Evaluating Modularity Concepts · IEEE Trans. Software Eng. 1979

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

knot count · 0.0halstead software effort · 0.0cyclomatic complexity · 0.0software science effort measure · 0.0data flow analysis · 0.0
YearPublicationVenuePosition
2000 Executing Formal Specifications with Concurrent Constraint Programming
Tim Wahls, Gary T. Leavens, Albert L. Baker
Autom. Softw. Eng.3
1991 Deliberations on Kung's process interface modeling
David L. Coleman, Albert L. Baker
J. Syst. Softw.2
1990 A philosophy for software measurement
Albert L. Baker, James M. Bieman, Norman E. Fenton, David A. Gustafson, Austin Melton, Robin W. Whitty
J. Syst. Softw.1
1989 Rigorous definition and analysis of program complexity measures: An example using nesting
James W. Howatt, Albert L. Baker
J. Syst. Softw.2
1988 The software process model
abstract
The authors define a software process model (SPM). The SPM is a model of evolution of the full set of documents produced in a software project. It is a general model for software development using any development approach, providing a framework for measuring, analyzing, and understanding the software development process. The authors use the model to characterize formally research in software measures and metrics. Data obtained from two software projects are presented in the SPM format.>
David A. Gustafson, Austin Melton, Ying-Chi Chen, Albert L. Baker, James M. Bieman
COMPSAC4
1988 A standard representation of imperative language programs for data collection and software measures specification
James M. Bieman, Albert L. Baker, Paul N. Clites, David A. Gustafson, Austin Melton
J. Syst. Softw.2
1980 A Comparison of Measures of Control Flow Complexity
abstract
In attempting to describe the quality of computer software, one of the more frequently mentioned measurable attributes is complexity of the flow of control. During the past several years, there have been many attempts to quantify this aspect of computer programs, approaching the problem from such diverse points of view as graph theory and software science. Most notable measures in these areas are McCabe's cyclomatic complexity and Halstead's software effort. More recently, Woodward et al. proposed a complexity measure based on the number of crossings, or "knots," of arcs in a linearization of the flowgraph.
Albert L. Baker, Stuart H. Zweben
IEEE Trans. Software Eng.1
1979 A comparison of measures of control flow complexity
abstract
In attempting to describe the quality of computer software, one of the more frequently mentioned measurable attributes is complexity of the flow of control. During the past several years, there have been many attempts to quantify this aspect of computer programs, approaching the problem from such diverse points of view as graph theory and software science. Most notable measures in these areas are McCabe's cyclomatic complexity and Halstead's software effort. More recently, Woodward et al. proposed a complexity measure based on the number of crossings, or knots, of arcs in a linearization of the flowgraph.
Albert L. Baker, Stuart H. Zweben
COMPSAC1
1979 The Use of Software Science in Evaluating Modularity Concepts
abstract
An investigation is made into the extent to which relationships from software science are useful in analyzing programming methodology principles that are concerned with modularity. Using previously published data from over 500 programs, it is shown that the software science effort measure provides quantitative answers to questions concerning the conditions under which modularization is beneficial. Among the issues discussed are the reduction of similar code sequences by temporary variable and subprogram defmition, and the use of global variables. Using data flow analysis, environmental considerations which affect the applicability of alternative modularity techniques are also discussed.
Albert L. Baker, Stuart H. Zweben
IEEE Trans. Software Eng.1