EDBT 2026 Demo / reviewers in the wild / expert
Apostolos D. Kallis
dblp:125/2391
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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 |
Programming languages and type systems · 50% Concurrent programming · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems › language design
parallel language design |
0.0 | 1 | 1989 | Refined Fortran: an update · SC 1989 |
Parallel and multicore computing
parallel programming models |
0.0 | 1 | 1989 | Refined Fortran: an update · SC 1989 |
Methods — techniques the papers use, named apart from their topics
determinism guarantees · 0.0data-oriented constructs · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | FATCAT: a tool to aid in maintaining, modifying, and enhancing Fortran codesabstractFATCAT (Fortran Advanced Technology Code Analysis Tool) is a software tool designed to aid the programmer in maintaining, modifying, and enhancing substantial production programs (a thousand to over a million lines long). FATCAT is also extremely useful in aiding the programmer in parallelizing Fortran code. FATCAT analyzes sequential code written in ANSI Fortran '77. It also 'understands' Cray Fortran (CFT) extensions, such as recursion and pointer variables. Like some cross-reference-table producing tools, FATCAT also understands the effects on variable usage of COMMON and EQUIVALENCE statements. Unlike most such tools, however, it also accounts for the effects of SUBROUTINE and FUNCTION calls, including recursive calls, of array subscripting, and of dereferencing CFT-style pointer variables.> Robert G. Babb II, David Klappholz, Apostolos D. Kallis |
ICSM | 3 |
| 1989 | Refined Fortran: an updateabstractRefined Languages (Refined Fortran, Refined C, etc.) are extensions of their parent languages in which it is possible to express parallelism, but impossible to create races or deadlocks. Where strictly deterministic behavior is desired, multiple executions of a Refined Fortran program with the same input data can be guaranteed to either compute the same results or terminate with the same run-time errors regardless of differences in scheduling. Where asynchronous behavior is desired, freedom from races can be guaranteed. The Refined Languages approach achieves its goal by extending sequential imperative programming languages with data- (rather than control-) oriented constructs, and by viewing the expression of parallelism in data- (rather than control-) oriented terms. Earlier versions of Refined Fortran are discussed in [1]-[2]; the present work supersedes and extends work reported in these earlier publications. David Klappholz, Xiangyun Kong, Apostolos D. Kallis |
SC | 3 |