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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Maryam Emami

dblp:20/2060 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · unresolved

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
Program analysis · 87% Programming languages and type systems · 13%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis
pointer analysis		 0.011994
Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers · PLDI 1994
Program analysis
static analysis		 0.011994
Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers · PLDI 1994
Programming languages and type systems › programming paradigms › imperative languages
c		 0.011994
Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers · PLDI 1994

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

stack location approximation · 0.0context-sensitive interprocedural analysis · 0.0
YearPublicationVenuePosition
1994 Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers
abstract
This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C. The method is based on approximating the points-to relationships between accessible stack locations, and can be used to generate alias pairs, or used directly for other analyses and transformations.
Maryam Emami, Rakesh Ghiya, Laurie J. Hendren
 PLDI1