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

Thomas E. Cheatham Jr.

dblp:31/6429 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1984
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 4 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
4 papers
Program verification · 32% Program analysis · 32% Compilers and program optimization · 28%

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

TopicWeightPapersLastEvidence papers
Program verification › refinement
program refinement
0.021981
Program Refinement by Transsformation · ICSE 1981
A System for Program Refinement · ICSE 1979
Compilers and program optimization
program transformation
0.011984
Reusability Through Program Transformations · IEEE Trans. Software Eng. 1984
Program analysis
static analysis
0.011979
Symbolic Evaluation and the Analysis of Programs · IEEE Trans. Software Eng. 1979
Program analysis
symbolic execution
0.011979
Symbolic Evaluation and the Analysis of Programs · IEEE Trans. Software Eng. 1979
Software maintenance and evolution
software reuse
0.011984
Reusability Through Program Transformations · IEEE Trans. Software Eng. 1984
Program analysis › data flow analysis
path-sensitive analysis
0.011979
Symbolic Evaluation and the Analysis of Programs · IEEE Trans. Software Eng. 1979

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

program transformation · 0.0syntactic extension · 0.0symbolic evaluation · 0.0recurrence relation solving · 0.0
YearPublicationVenuePosition
1984 Reusability Through Program Transformations
abstract
We describe a methodology and supporting programming environment that provide for reuse of abstract programs. Abstract programs are written using notations and constructs natural to the problem domain in a language realized by syntactic extension of a base language. Program transformations are employed to refine an abstract program into its concrete counterpart. We discuss the use of the methodology in the setting of rapid prototyping and custom tailoring.
Thomas E. Cheatham Jr.
IEEE Trans. Software Eng.1
1981 Program Refinement by Transsformation
Thomas E. Cheatham Jr., Glenn H. Holloway, Judy A. Townley
ICSE1
1981 Editorial: Program Transformations
Robert Balzer, Thomas E. Cheatham Jr.
IEEE Trans. Software Eng.2
1979 A System for Program Refinement
Thomas E. Cheatham Jr., Judy A. Townley, Glenn H. Holloway
ICSE1
1979 Symbolic Evaluation and the Analysis of Programs
abstract
Symbolic evaluation is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations. It does not require the user to specify which path at a conditional branch to follow nor how many cycles of a loop to consider. Instead, a symbolic evaluator uses conditional expressions to represent the uncertainty that arises from branching and develops and attempts to solve recurrence relations that describe the behavior of loop variables.
Thomas E. Cheatham Jr., Glenn H. Holloway, Judy A. Townley
IEEE Trans. Software Eng.1