182
click to vote
POPL
2003
ACM
16 years 22 days ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
160
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
189
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
186
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
190
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
207
click to vote
POPL
2003
ACM
16 years 22 days ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
180
click to vote
POPL
2003
ACM
16 years 22 days ago
2003
ACM
Ownership types provide a statically enforceable way of specifying object encapsulation and enable local reasoning about program correctness in object-oriented languages. However,...
172
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
143
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
153
Voted
POPL
2003
ACM
16 years 22 days ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...