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

Ben Bellamy

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

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

Software engineering, systems software and programming languages · 1 · 1 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
Programming languages and type systems · 56% Program analysis · 44%

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

TopicWeightPapersLastEvidence papers
Program analysis › binary analysis
bytecode analysis
0.112008
Efficient local type inference · OOPSLA 2008
Programming languages and type systems › type inference
local type inference
0.112008
Efficient local type inference · OOPSLA 2008
Programming languages and type systems › type inference
static type inference
0.012008
Efficient local type inference · OOPSLA 2008

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

data flow analysis · 0.1
YearPublicationVenuePosition
2008 Efficient local type inference
abstract
Inference of static types for local variables in Java bytecode is the first step of any serious tool that manipulates bytecode, be it for decompilation, transformation or analysis. It is important, therefore, to perform that step as accurately and efficiently as possible. Previous work has sought to give solutions with good worst-case complexity.
Ben Bellamy, Pavel Avgustinov, Oege de Moor, Damien Sereni
OOPSLA1