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

Christopher Unkel

dblp:48/5999 · DBLP profile ↗
← Back
2ranked-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-authorDatabases, data management, data science and information retrieval · 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
2 papers
Program analysis · 70% Programming languages and type systems · 30%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › object-oriented programming
java
0.112008
Automatic inference of stationary fields: a generalization of java's final fields · POPL 2008
Program analysis
static analysis
0.112008
Automatic inference of stationary fields: a generalization of java's final fields · POPL 2008
Program analysis › static analysis › interprocedural analysis
context-sensitive analysis
0.112005
Context-sensitive program analysis as database queries · PODS 2005
Program analysis › static analysis
pointer analysis
0.112005
Context-sensitive program analysis as database queries · PODS 2005

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

datalog · 0.1
YearPublicationVenuePosition
2008 Automatic inference of stationary fields: a generalization of java's final fields
abstract
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be used in program understanding and detection of errors in new code additions. Unfortunately, few fields in programs are actually declared final. Programs often contain fields that could be final, but are not declared so. Moreover, the definition of final has restrictions on initializationthat limit its applicability.
Christopher Unkel, Monica S. Lam
POPL1
2005 Context-sensitive program analysis as database queries
abstract
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often require analyses much more sophisticated than those traditionally used in compiler optimizations. In particular, context-sensitive pointer alias information is a prerequisite for any sound and precise analysis that reasons about uses of heap objects in a program. Context-sensitive analysis is challenging because there are over 1014 contexts in a typical large program, even after recursive cycles are collapsed. Moreover, pointers cannot be resolved in general without analyzing the entire program.
Monica S. Lam, John Whaley, Benjamin Livshits, Michael C. Martin, Dzintars Avots, Michael Carbin, Christopher Unkel
PODS7