Demo Data from VLDB 2026 / reviewers in the wild / expert
Paul W. Abrahams
dblp:22/4940
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1979
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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
1 paper |
Compilers and program optimization · 62% Programming languages and type systems · 19% Software testing · 19% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
compiler analysis |
0.0 | 1 | 1979 | Compile-Time Analysis of Data List-Format List Correspondences · IEEE Trans. Software Eng. 1979 |
Software testing
test input generation |
0.0 | 1 | 1979 | Compile-Time Analysis of Data List-Format List Correspondences · IEEE Trans. Software Eng. 1979 |
Methods — techniques the papers use, named apart from their topics
formal language theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1979 | Compile-Time Analysis of Data List-Format List CorrespondencesabstractFormatted input-output is available in a number of programming languages. In the most general case, the correspondence between data items and format items cannot be determined during compilation, and so it is determined dynamically during execution. However, in most pairs of data and format lists that occur in practice, determination of the correspondence is in fact possible during compilation. Although some commercial compilers make this determination, there is little published literature on the subject. In this paper, we briefly examine three areas in which compile-time determination of the data-format correspondence is useful: optimization, program validation, and automatic test data generation. A formalism for stating the problem is given, and a solution is discussed in terms of formal language theory. Using this formalism, an algorithm for determining the correspondence is given, and its application is illustrated by examples in both PL/I and Fortran. Paul W. Abrahams, Lori A. Clarke |
IEEE Trans. Software Eng. | 1 |