Roger Hoover

dblp:27/5592 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1996
—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-authorTheory of computation · 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
3 papers
Compilers and program optimization · 62% Program analysis · 21% Programming languages and type systems · 17%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › compiler construction
compiler generation
0.011996
Generating Machine Specific Optimizing Compilers · POPL 1996
Compilers and program optimization › compiler optimization
machine-specific optimization
0.011996
Generating Machine Specific Optimizing Compilers · POPL 1996
Compilers and program optimization
optimizing compiler
0.011996
Generating Machine Specific Optimizing Compilers · POPL 1996
Program analysis › static analysis
incremental analysis
0.021992
Alphonse: Incremental Computation as a Programming Abstraction · PLDI 1992
Dynamically Bypassing Copy Rule Chains in Attribute Grammars · POPL 1986
Programming languages and type systems › language design
programming abstractions
0.011992
Alphonse: Incremental Computation as a Programming Abstraction · PLDI 1992
Algorithms and data structures
dynamic algorithms
0.011990
Incremental Evaluation of Computational Circuits · SODA 1990
Algorithms and data structures › dynamic algorithms
incremental algorithms
0.011990
Incremental Evaluation of Computational Circuits · SODA 1990
Programming languages and type systems › grammar formalisms
attribute grammars
0.011986
Dynamically Bypassing Copy Rule Chains in Attribute Grammars · POPL 1986
Program analysis › dynamic analysis
dynamic dependency analysis
0.011992
Alphonse: Incremental Computation as a Programming Abstraction · PLDI 1992

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

program transformation · 0.0dynamic dependency analysis · 0.0incremental evaluation · 0.0
YearPublicationVenuePosition
1996 Generating Machine Specific Optimizing Compilers
abstract
Article Generating machine specific optimizing compilers Share on Authors: Roger Hoover Computer Science Department, IBM TJ Watson Research Center, PO Box 704, Yorktown Heights, NY Computer Science Department, IBM TJ Watson Research Center, PO Box 704, Yorktown Heights, NYView Profile , Kenneth Zadeck Computer Science Department, IBM TJ Watson Research Center, PO Box 704, Yorktown Heights, NY Computer Science Department, IBM TJ Watson Research Center, PO Box 704, Yorktown Heights, NYView Profile Authors Info & Claims POPL '96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 1996 Pages 219–229https://doi.org/10.1145/237721.237779Published:01 January 1996 6citation31DownloadsMetricsTotal Citations6Total Downloads31Last 12 Months5Last 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 SiteGet Access
Roger Hoover, F. Kenneth Zadeck
POPL1
1992 Alphonse: Incremental Computation as a Programming Abstraction
abstract
Alphonse is a program transformation system that uses dynamic dependency analysis and incremental computation techniques to automatically generate efficient dynamic implementations from simple exhaustive imperative program specifications.
Roger Hoover
PLDI1
1990 Incremental Evaluation of Computational Circuits
Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck
SODA2
1986 Dynamically Bypassing Copy Rule Chains in Attribute Grammars
abstract
Attribute grammars require copy rules to transfer values between attribute instances distant in an attributed parse tree. We introduce copy bypass attribute propagation that dynamically replaces copy rules with nonlocal dependencies, resulting in faster incremental evaluation. A evaluation strategy is used that approximates a topological ordering of attribute instances. The result is an efficient incremental evaluator that allows multiple subtree replacement on any noncircular attribute grammar.
Roger Hoover
POPL1