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

Nathan Harada

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

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

Systems, architecture and hardware · 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
Compilers and program optimization · 50% Program analysis · 50%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › dynamic optimization
profile-guided optimization
0.212016
CrystalBall: Statically analyzing runtime behavior via deep sequence learning · MICRO 2016
Program analysis
static analysis
0.212016
CrystalBall: Statically analyzing runtime behavior via deep sequence learning · MICRO 2016

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

intermediate representation analysis · 0.5deep sequence learning · 0.5AUROC · 0.5
YearPublicationVenuePosition
2016 CrystalBall: Statically analyzing runtime behavior via deep sequence learning
abstract
Understanding dynamic program behavior is critical in many stages of the software development lifecycle, for purposes as diverse as optimization, debugging, testing, and security. This paper focuses on the problem of predicting dynamic program behavior statically. We introduce a novel technique to statically identify hot paths that leverages emerging deep learning techniques to take advantage of their ability to learn subtle, complex relationships between sequences of inputs. This approach maps well to the problem of identifying the behavior of sequences of basic blocks in program execution. Our technique is also designed to operate on the compiler's intermediate representation (IR), as opposed to the approaches taken by prior techniques that have focused primarily on source code, giving our approach language-independence. We describe the pitfalls of conventional metrics used for hot path prediction such as accuracy, and motivate the use of Area Under the Receiver Operating Characteristic curve (AUROC). Through a thorough evaluation of our technique on complex applications that include the SPEC CPU2006 benchmarks, we show that our approach achieves an AUROC of 0.85.
Stephen A. Zekany, Daniel Rings, Nathan Harada, Michael Laurenzano, Lingjia Tang, Jason Mars
MICRO3