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

Jesse Ruderman

dblp:79/7062 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2009
—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
Runtime systems and virtual machines · 61% Compilers and program optimization · 30% Programming languages and type systems · 9%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines › dynamic compilation
just-in-time compilation
0.112009
Trace-based just-in-time type specialization for dynamic languages · PLDI 2009
Runtime systems and virtual machines › dynamic compilation › just-in-time compilation
trace-based compilation
0.112009
Trace-based just-in-time type specialization for dynamic languages · PLDI 2009
Compilers and program optimization › program specialization
type specialization
0.112009
Trace-based just-in-time type specialization for dynamic languages · PLDI 2009
Programming languages and type systems
dynamic languages
0.012009
Trace-based just-in-time type specialization for dynamic languages · PLDI 2009

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

type specialization · 0.1trace compilation · 0.1
YearPublicationVenuePosition
2009 Trace-based just-in-time type specialization for dynamic languages
abstract
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit generic code that can handle all possible type combinations at runtime. We present an alternative compilation technique for dynamically-typed languages that identifies frequently executed loop traces at run-time and then generates machine code on the fly that is specialized for the actual dynamic types occurring on each path through the loop. Our method provides cheap inter-procedural type specialization, and an elegant and efficient way of incrementally compiling lazily discovered alternative paths through nested loops. We have implemented a dynamic compiler for JavaScript based on our technique and we have measured speedups of 10x and more for certain benchmark programs.
Andreas Gal, Brendan Eich, Mike Shaver, David Mandelin, Mohammad R. Haghighat, Blake Kaplan, Graydon Hoare, Boris Zbarsky, Jason Orendorff, Jesse Ruderman, Edwin W. Smith, Rick Reitmaier, Michael Bebenita, Mason Chang, Michael Franz
PLDI11