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
Demo Data from VLDB 2026 / reviewers in the wild / expert

David R. Chase

dblp:39/2585 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1990
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 3 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
3 papers
Compilers and program optimization · 48% Program analysis · 44% Operating systems · 8%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis
pointer analysis		 0.011990
Analysis of Pointers and Structures · PLDI 1990
Compilers and program optimization › intermediate representation
static single assignment form		 0.011988
Safety Considerations for Storage Allocation Optimizations · PLDI 1988
Compilers and program optimization
tree pattern matching		 0.011987
An Improvement to Bottom-up Tree Pattern Matching · POPL 1987
Program analysis
static analysis		 0.011990
Analysis of Pointers and Structures · PLDI 1990
Operating systems › resource management
memory management		 0.011988
Safety Considerations for Storage Allocation Optimizations · PLDI 1988
Algorithms and data structures › sequence algorithms › string algorithms
string matching		 0.011987
An Improvement to Bottom-up Tree Pattern Matching · POPL 1987
Algorithms and data structures › sequence algorithms › string algorithms › string matching
tree pattern matching		 0.011987
An Improvement to Bottom-up Tree Pattern Matching · POPL 1987

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

algorithm design · 0.0
YearPublicationVenuePosition
1990 Analysis of Pointers and Structures
abstract
article Free Access Share on Analysis of pointers and structures Authors: David R. Chase View Profile , Mark Wegman IBM T. J. Watson Research Center, P.O. Box 704, Yorktown, Heights, NY IBM T. J. Watson Research Center, P.O. Box 704, Yorktown, Heights, NYView Profile , F. Kenneth Zadeck Computer Science Dept., P.O. Box 1910, Brown University, Providence Computer Science Dept., P.O. Box 1910, Brown University, ProvidenceView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 25Issue 6Jun. 1990 pp 296–310https://doi.org/10.1145/93548.93585Online:01 June 1990Publication History 431citation2,454DownloadsMetricsTotal Citations431Total Downloads2,454Last 12 Months69Last 6 weeks21 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
David R. Chase, Mark N. Wegman, F. Kenneth Zadeck
 PLDI1
1988 Safety Considerations for Storage Allocation Optimizations
abstract
Article Free Access Share on Safety consideration for storage allocation optimizations Author: D. R. Chase Olvetti Research Center, Menlo Park, CA Olvetti Research Center, Menlo Park, CAView Profile Authors Info & Claims PLDI '88: Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementationJune 1988 Pages 1–10https://doi.org/10.1145/53990.53991Published:01 June 1988Publication History 27citation666DownloadsMetricsTotal Citations27Total Downloads666Last 12 Months11Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
David R. Chase
 PLDI1
1987 An Improvement to Bottom-up Tree Pattern Matching
abstract
Article Free Access Share on An improvement to bottom-up tree pattern matching Author: D. R. Chase Department of Computer Science, Rice University, Houston, Texas Department of Computer Science, Rice University, Houston, TexasView Profile Authors Info & Claims POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesOctober 1987Pages 168–177https://doi.org/10.1145/41625.41640Published:01 October 1987Publication History 56citation855DownloadsMetricsTotal Citations56Total Downloads855Last 12 Months79Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Publisher SiteeReaderPDF
David R. Chase
 POPL1