William Pugh, Craig Chambers
Proceedings of the 25th Conference on Programming Language Design and Implementation
PLDI, 2004.

@proceedings{PLDI-2004,
	address       = "Washington, District of Columbia, USA",
	editor        = "William Pugh and Craig Chambers",
	isbn          = "1-58113-807-5",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 25th Conference on Programming Language Design and Implementation}",
	year          = 2004,
}

Contents (26 items)

3 ×#analysis
3 ×#source code
3 ×#using
2 ×#abstraction
2 ×#array
2 ×#constraints
2 ×#effectiveness
2 ×#named
2 ×#parallel
2 ×#parametricity

PLDI-2004-HenzingerJM

Race checking by context inference (TAH, RJ, RM), pp. 1–13.

PLDI-2004-QadeerW #named

KISS: keep it simple and sequential (SQ, DW), pp. 14–24.

PLDI-2004-YahavR #abstraction #safety #using #verification

Verifying safety properties using separation and heterogeneous abstractions (EY, GR), pp. 25–34.

PLDI-2004-Michael #memory management #scalability

Scalable lock-free dynamic memory allocation (MMM), pp. 35–46.

PLDI-2004-FlattF #abstraction

Kill-safe synchronization abstractions (MF, RBF), pp. 47–58.

PLDI-2004-JohnsonEV #composition #concurrent #thread

Min-cut program decomposition for thread-level speculation (TAJ, RE, TNV), pp. 59–70.

PLDI-2004-DuLLYZN #compilation #framework #parallel #source code

A cost-driven compilation framework for speculative parallelization of sequential programs (ZHD, CCL, XFL, CY, QZ, TFN), pp. 71–81.

PLDI-2004-EichenbergerWO #architecture #constraints

Vectorization for SIMD architectures with alignment constraints (AEE, PW, KO), pp. 82–93.

PLDI-2004-ZhangG #effectiveness #slicing

Cost effective dynamic program slicing (XZ, RG), pp. 94–106.

PLDI-2004-CollbergCDHKLS

Dynamic path-based software watermarking (CSC, EC, SKD, AH, JDK, CL, MS), pp. 107–118.

PLDI-2004-WangL #adaptation #analysis #parametricity

Parametric analysis for adaptive computation offloading (CW, ZL), pp. 119–130.

PLDI-2004-WhaleyL #alias #analysis #diagrams #pointer #using

Cloning-based context-sensitive pointer alias analysis using binary decision diagrams (JW, MSL), pp. 131–144.

PLDI-2004-ZhuC #analysis #pointer #revisited

Symbolic pointer analysis revisited (JZ, SC), pp. 145–157.

PLDI-2004-LhotakH #java #named #relational

Jedd: a BDD-based relational extension of Java (OL, LJH), pp. 158–169.

PLDI-2004-Appel #process #proving #revisited #social #source code #theorem

Social processes and proofs of theorems and programs, revisited (AWA), p. 170.

PLDI-2004-KulkarniHHWDJ #effectiveness #optimisation #performance #sequence

Fast searches for effective optimization phase sequences (PAK, SH, JH, DBW, JWD, DLJ), pp. 171–182.

PLDI-2004-CavazosEM #heuristic

Inducing heuristics to decide whether to schedule (JC, JEBM), pp. 183–194.

PLDI-2004-VachharajaniVA #component #modelling #reuse #specification

The liberty structural specification language: a high-level modeling language for component reuse (MV, NV, DIA), pp. 195–206.

PLDI-2004-KodumalA #constraints #reachability #set

The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.

PLDI-2004-LiuRYSH #parametricity #query

Parametric regular path queries (YAL, TR, FY, SDS, NH), pp. 219–230.

PLDI-2004-VenetB #array #bound #c #embedded #performance #precise #scalability #source code

Precise and efficient static array bound checking for large embedded C programs (AV, GPB), pp. 231–242.

PLDI-2004-ChinCQR #object-oriented

Region inference for an object-oriented language (WNC, FC, SQ, MCR), pp. 243–254.

PLDI-2004-ZhongOSD #array #using

Array regrouping and structure splitting using whole-program reference affinity (YZ, MO, XS, CD), pp. 255–266.

PLDI-2004-Adl-TabatabaiHSS #hardware #metadata #monitoring

Prefetch inection based on hardware monitoring and object metadata (ARAT, RLH, MJS, SS), pp. 267–276.

PLDI-2004-SmithRH #algorithm #graph

A generalized algorithm for graph-coloring register allocation (MDS, NR, GHH), pp. 277–288.

PLDI-2004-ZhuangP #network #parallel #thread

Balancing register allocation across threads for a multithreaded network processor (XZ, SP), pp. 289–300.