Demo Data from VLDB 2026 / reviewers in the wild / expert
Judy A. Townley
dblp:19/180
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3
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 |
Program verification · 50% Program analysis · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification › refinement
program refinement |
0.0 | 2 | 1981 | Program Refinement by Transsformation · ICSE 1981 A System for Program Refinement · ICSE 1979 |
Program analysis
static analysis |
0.0 | 1 | 1979 | Symbolic Evaluation and the Analysis of Programs · IEEE Trans. Software Eng. 1979 |
Program analysis
symbolic execution |
0.0 | 1 | 1979 | Symbolic Evaluation and the Analysis of Programs · IEEE Trans. Software Eng. 1979 |
Program analysis › data flow analysis
path-sensitive analysis |
0.0 | 1 | 1979 | 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.0symbolic evaluation · 0.0recurrence relation solving · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | Program Refinement by Transsformation
Thomas E. Cheatham Jr., Glenn H. Holloway, Judy A. Townley |
ICSE | 3 |
| 1979 | A System for Program Refinement
Thomas E. Cheatham Jr., Judy A. Townley, Glenn H. Holloway |
ICSE | 2 |
| 1979 | Symbolic Evaluation and the Analysis of ProgramsabstractSymbolic 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. | 3 |