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.

George Kalligiannis

dblp:78/2309 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · none

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

Software 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
Software maintenance and evolution · 44% Debugging and program repair · 44% Programming languages and type systems · 13%

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

TopicWeightPapersLastEvidence papers
Debugging and program repair
data structure visualization
0.011983
A Very High-Level Interactive Graphical Trace for the Pascal Heap · IEEE Trans. Software Eng. 1983
Software maintenance and evolution › program comprehension
software visualization
0.011983
A Very High-Level Interactive Graphical Trace for the Pascal Heap · IEEE Trans. Software Eng. 1983
Programming languages and type systems › programming paradigms › imperative languages
pascal
0.011983
A Very High-Level Interactive Graphical Trace for the Pascal Heap · IEEE Trans. Software Eng. 1983

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

graphical trace · 0.0directed graph display · 0.0
YearPublicationVenuePosition
1983 A Very High-Level Interactive Graphical Trace for the Pascal Heap
abstract
A very high-level trace for data structures is one which displays a data structure in the shape in which the user conceptualizes it, be it a tree, an array, or a graph. GRAPHTRACE is a system that facilitates the very high-level graphic display of interrelationships among dynamically allocated Pascal records. It offers the user a wide range of options to enable him to "see" the data structures on a graphics screen in a format as close as possible to that in which he visualizes it, thereby providing a useful display capability when the user's conceptual model is a directed graph or tree.
Sidney L. Getz, George Kalligiannis, Stephen R. Schach
IEEE Trans. Software Eng.2