Pointer Analysis in PLDI/POPL from 1998

PLDI (Programming Language Design and Implementation) is the best conference in programming language field. Pointer or alias analysis is always an important topic in PLDI conferences.

	Total papers	Pointer Analysis	Related
PLDI'98	31	3	1
PLDI'99	26	2	2
PLDI'00	30	4	2
PLDI'01	30	4	1
PLDI'02	28	0	3
PLDI'03	28	2	1
PLDI'04	26	2	2
PLDI'05	29	0	1
PLDI'06	36	2	3
PLDI'07	45	2	4
PLDI'08	34	1	4
PLDI'09	41	0	3
PLDI'10	41	1	1
PLDI'11	55	0	1
PLDI'12	48	1	0

PLDI'98 Total 31 papers

Pointer Analysis

Manuel Fähndrich , Jeffrey S. Foster , Zhendong Su , Alexander Aiken : Partial Online Cycle Elimination in Inclusion Constraint Graphs. 85-96
Rebecca Hasti , Susan Horwitz : Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis. 97-105
Amer Diwan , Kathryn S. McKinley , J. Eliot B. Moss : Type-Based Alias Analysis. 106-117

David Gay , Alexander Aiken : Memory Management with Explicit Regions. 313-323

PLDI'99 Total 26 papers

Pointer Analysis

Radu Rugina , Martin C. Rinard : Pointer Analysis for Multithreaded Programs. 77-90
Suan Hsi Yong , Susan Horwitz , Thomas W. Reps : Pointer Analysis for Programs with Structures and Casting. 91-103

Rastislav Bodík , Rajiv Gupta , Mary Lou Soffa : Load-Reuse Analysis: Design and Evaluation. 64-76
Allen Leung , Lal George : Static Single Assignment Form for machine Code. 204-214

PLDI'00 Total 30 papers

Pointer Analysis

Manuvir Das : Unification-based pointer analysis with directional assignments. 35-46
Atanas Rountev , Satish Chandra : Off-line variable substitution for scaling points-to analysis. 47-56
Ben-Chung Cheng , Wen-mei W. Hwu : Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. 57-69
Manuel Fähndrich , Jakob Rehof , Manuvir Das : Scalable context-sensitive flow analysis using instantiation constraints. 253-263

Radu Rugina , Martin C. Rinard : Symbolic bounds analysis of pointers, array indices, and accessed memory regions. 182-195
G. Ramalingam : On loops, dominators, and dominance frontier. 233-241

PLDI'01 Total 30 papers

Pointer Analysis

Nevin Heintze , Olivier Tardieu : Demand-Driven Pointer Analysis. 24-34
Frédéric Vivien , Martin C. Rinard : Incrementalized Pointer and Escape Analysis. 35-46
Rakesh Ghiya , Daniel M. Lavery , David C. Sehr : On the Importance of Points-to Analysis and Other Memory Disambiguation Methods for C Programs. 47-58
Nevin Heintze , Olivier Tardieu : Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second. 254-263

David Gay , Alexander Aiken : Language Support for Regions. 70-80

PLDI'02 Total 28 papers

Jeffrey S. Foster , Tachio Terauchi , Alexander Aiken : Flow-Sensitive Type Qualifiers. 1-12
Manuvir Das , Sorin Lerner , Mark Seigle : ESP: Path-Sensitive Program Verification in Polynomial Time. 57-68
Seth Hallem , Benjamin Chelf , Yichen Xie , Dawson R. Engler : A System and Language for Building System-Specific, Static Analyses. 69-82

PLDI'03 Total 28 papers

Pointer Analysis

Marc Berndl , Ondrej Lhoták , Feng Qian , Laurie J. Hendren , Navindra Umanee : Points-to analysis using BDDs. 103-114
Alexander Aiken , Jeffrey S. Foster , John Kodumal , Tachio Terauchi : Checking and inferring local non-aliasing. 129-140

David L. Heine , Monica S. Lam : A practical flow-sensitive and context-sensitive C and C++ memory leak detector. 168-181

PLDI'04 Total 26 papers

Pointer Analysis

John Whaley , Monica S. Lam : Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. 131-144
Jianwen Zhu , Silvian Calman : Symbolic pointer analysis revisited. 145-157

John Kodumal , Alexander Aiken : The set constraint/CFL reachability connection in practice. 207-218
Yanhong A. Liu , Tom Rothamel , Fuxiang Yu , Scott D. Stoller , Nanjun Hu : Parametric regular path queries. 219-230

PLDI'05 Total 29 papers

Ranjit Jhala , Rupak Majumdar : Path slicing. 38-47

PLDI'06 Total 36 papers

Pointer Analysis

Dinakar Dhurjati , Sumant Kowshik , Vikram S. Adve : SAFECode: enforcing alias analysis for weakly typed languages. 144-157
Manu Sridharan , Rastislav Bodík : Refinement-based context-sensitive points-to analysis for Java. 387-400

Mayur Naik , Alex Aiken , John Whaley : Effective static race detection for Java. 308-319
Polyvios Pratikakis , Jeffrey S. Foster , Michael W. Hicks : LOCKSMITH: context-sensitive correlation analysis for race detection. 320-331
Samuel Guyer, Kathryn McKinley, Daniel Framption. Free-Me: A Static Analysis for Automatic Individual Object Reclamation.

PLDI'07 Total 45 papers

Pointer Analysis

Chris Lattner , Andrew Lenharth , Vikram S. Adve : Making context-sensitive points-to analysis with heap cloning practical for the real world. 278-289
Ben Hardekopf , Calvin Lin : The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. 290-299

Bolei Guo , Neil Vachharajani , David I. August : Shape analysis with inductive recursion synthesis. 256-265
Alexey Gotsman , Josh Berdine , Byron Cook , Mooly Sagiv : Thread-modular shape analysis. 266-277
Manu Sridharan , Stephen J. Fink , Rastislav Bodík : Thin slicing. 112-122
Sigmund Cherem , Lonnie Princehouse , Radu Rugina : Practical memory leak detection using guarded value-flow analysis. 480-491

PLDI'08 Total 34 papers

Pointer Analysis

Vineet Kahlon : Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis. 249-259

Isil Dillig , Thomas Dillig , Alex Aiken : Sound, complete and scalable path-sensitive analysis. 270-280
Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan : Program analysis as constraint solving. 281-292
Sigmund Cherem , Trishul M. Chilimbi , Sumit Gulwani : Inferring locks for atomic sections. 304-315
Ravi Chugh , Jan Wen Voung , Ranjit Jhala , Sorin Lerner : Dataflow analysis for concurrent programs using datarace detection. 316-326

PLDI'09 Total 41 papers

Pieter Hooimeijer , Westley Weimer : A decision procedure for subset constraints over regular languages. 188-198
Sumit Gulwani , Sagar Jain , Eric Koskinen : Control-flow refinement and progress invariants for bound analysis. 375-385
Guoqing (Harry) Xu , Matthew Arnold , Nick Mitchell , Atanas Rountev , Gary Sevitsky : Go with the flow: profiling copies to find runtime bloat. 419-430

PLDI'10 Total 41 papers

Pointer Analysis

Matthew Might , Yannis Smaragdakis , David Van Horn : Resolving and exploiting the k -CFA paradox: illuminating functional vs. object-oriented program analysis. 305-315

Sumit Gulwani , Florian Zuleger : The reachability-bound problem. 292-304

PLDI'11 Total 55 papers

Pointer Analysis

Isil Dillig , Thomas Dillig, Alex Aiken , Mooly Sagiv: Precise and Compact Modular Procedure Summaries for Heap Manipulating Programs

Pointer Analysis

Jingyue Wu, Yang Tang, Gang Hu, Heming Cui, Junfeng Yang: Sound and Precise Analysis of Multithreaded Programs through Schedule Specialization.

	Total papers	Pointer Analysis	Related
POPL'98	32	4	1
POPL'99	28	0	2
POPL'00	31	1	2
POPL'01	26	1	0
POPL'02	30	0	0
POPL'03	30	1	0
POPL'04	29	0	0
POPL'05	31	0	1
POPL'06	36	0	0
POPL'07	37	1	0
POPL'08	38	1	3
POPL'09	36	1	1
POPL'10	39	0	3
POPL'11	48	3	3
POPL'12	44	0	1

POPL'98

Pointer Analysis

Saumya K. Debray , Robert Muth , Matthew Weippert : Alias Analysis of Executable Code. 12-24

Rakesh Ghiya , Laurie J. Hendren : Putting Pointer Analysis to Work. 121-133

Rastislav Bodík , Sadun Anik : Path-Sensitive Value-Flow Analysis. 237-251

Suresh Jagannathan , Peter Thiemann , Stephen Weeks , Andrew K. Wright : Single and Loving It: Must-Alias Analysis for Higher-Order Languages. 329-341

POPL'99

G. Ramalingam , John Field , Frank Tip : Aggregate Structure Identification and Its Application to Program Analysis. 119-132

POPL'00

Pointer Analysis

Zhendong Su , Manuel Fähndrich , Alexander Aiken : Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs. 81-95

Hanne Riis Nielson , Flemming Nielson : Shape Analysis for Mobile Ambients. 142-154

POPL'01

POPL'02

POPL'03

Pointer Analysis

Venkatesan T. Chakaravarthy : New results on the computability and complexity of points-to analysis. 115-125

POPL'04

POPL'05

POPL'06

POPL'07

Mayur Naik , Alex Aiken : Conditional must not aliasing for static race detection. 327-338

POPL'08

Pointer Analysis

Xin Zheng , Radu Rugina : Demand-driven alias analysis for C. 197-208

Greta Yorsh , Eran Yahav , Satish Chandra : Generating precise and concise procedure summaries. 221-234

Bor-Yuh Evan Chang , Xavier Rival : Relational inductive shape analysis. 247-260

POPL'09

Pointer Analysis

Ben Hardekopf , Calvin Lin : Semi-sparse flow-sensitive pointer analysis. 226-238

POPL'10

Swarat Chaudhuri , Sumit Gulwani , Roberto Lublinerman : Continuity analysis of programs. 57-70

William R. Harris , Sriram Sankaranarayanan , Franjo Ivancic , Aarti Gupta : Program analysis via satisfiability modulo path programs. 71-82

POPL'11

Y. Smaragdakis , M. Bravenboer , O. Lhotak : Pick Your Contexts Well: Understanding Object-Sensitivity (The Making of a Precise and Scalable Pointer Analysis)

P. Liang , O. Tripp , M. Naik : Learning Minimal Abstractions

X. Rival , B. Chang : Calling Context Abstraction with Shapes

I. Dillig , T. Dillig , A. Aiken : Precise Reasoning for Programs Using Containers

POPL'12

There are many different dimensions on pointer analysis problem, such as points-to analysis or alias analysis, flow sensitive or flow insensitive, context sensitive or context insensitive, unification-based or subset-based, field-sensitive or insensitive or field-based, whole program analysis or demand-driven analysis, for C or for JAVA. We try to classify the papers in several ways.

(TODO)

We try to summarize some trends from existing works.

(TODO)