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

Daniel R. Edelson

dblp:90/1414 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1992
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 2 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
Runtime systems and virtual machines · 87% Compilers and program optimization · 13%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
garbage collection
0.011992
A Mark-and-Sweep Collector for C++ · POPL 1992
Runtime systems and virtual machines › garbage collection
mark-and-sweep collection
0.011992
A Mark-and-Sweep Collector for C++ · POPL 1992

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

root registration · 0.0generational collection · 0.0
YearPublicationVenuePosition
1992 A Mark-and-Sweep Collector for C++
abstract
Our research is concerned with compiler-independent, tag-free garbage collection for the C++ programming language. We have previously presented a copying collector based on root registration. This paper presents a mark-and-sweep garbage collector that ameliorates shortcomings of the previous collector. We describe the two collectors and discuss why the new one is an improvement over the old one. We have tested this collector and a conservative collector in a VLSI CAD application, and this paper discusses the differences. Currently this prototype of the collector imposes too much overhead on our application. We intend to solve that problem, and then use the techniques described in this paper to implement a generational Mark-and-Sweep collector for C++.
Daniel R. Edelson
POPL1
1989 C++: Solving C's Shortcomings?
Daniel R. Edelson, Ira Pohl
Comput. Lang.1
1988 A To Z: C Language Shortcomings
Ira Pohl, Daniel R. Edelson
Comput. Lang.2