Michael Hind, Amer Diwan
Proceedings of the 30th Conference on Programming Language Design and Implementation
PLDI, 2009.

@proceedings{PLDI-2009,
	address       = "Dublin, Ireland",
	editor        = "Michael Hind and Amer Diwan",
	isbn          = "978-1-60558-392-1",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 30th Conference on Programming Language Design and Implementation}",
	year          = 2009,
}

Contents (41 items)

10 ×#named
6 ×#using
5 ×#analysis
5 ×#memory management
4 ×#concurrent
4 ×#detection
4 ×#source code
3 ×#approach
3 ×#bound
3 ×#data flow

PLDI-2009-SubramanianHM #approach

Dynamic software updates: a VM-centric approach (SS, MWH, KSM), pp. 1–12.

PLDI-2009-NeamtiuH #concurrent #multi #source code #thread

Safe and timely updates to multi-threaded programs (IN, MWH), pp. 13–24.

PLDI-2009-HammerAC #named #self

CEAL: a C-based language for self-adjusting computation (MAH, UAA, YC), pp. 25–37.

PLDI-2009-AnselCWOZEA #algorithm #compilation #named

PetaBricks: a language and compiler for algorithmic choice (JA, CPC, YLW, MO, QZ, AE, SPA), pp. 38–49.

PLDI-2009-ChughMJL #data flow #javascript #staged

Staged information flow for javascript (RC, JAM, RJ, SL), pp. 50–62.

PLDI-2009-RoyPBMW #data flow #distributed #fine-grained #named

Laminar: practical fine-grained decentralized information flow control (IR, DEP, MDB, KSM, EW), pp. 63–74.

PLDI-2009-LivshitsNRB #data flow #named #problem #specification

Merlin: specification inference for explicit information flow problems (VBL, AVN, SKR, AB), pp. 75–86.

PLDI-2009-TrippPFSW #analysis #effectiveness #named #web

TAJ: effective taint analysis of web applications (OT, MP, SJF, MS, OW), pp. 87–97.

PLDI-2009-AndersonGN #concurrent #data type #lightweight

Lightweight annotations for controlling sharing in concurrent data structures (ZRA, DG, MN), pp. 98–109.

PLDI-2009-JoshiPSN #detection #program analysis #random

A randomized dynamic program analysis technique for detecting real deadlocks (PJ, CSP, KS, MN), pp. 110–120.

PLDI-2009-FlanaganF #concurrent #detection #named #performance #precise

FastTrack: efficient and precise dynamic race detection (CF, SNF), pp. 121–133.

PLDI-2009-MarinoMN #concurrent #detection #effectiveness #lightweight #named

LiteRace: effective sampling for lightweight data-race detection (DM, MM, SN), pp. 134–143.

PLDI-2009-PetrankMS #bound #parallel #source code

Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.

PLDI-2009-DragojevicGK #memory management #transaction

Stretching transactional memory (AD, RG, MK), pp. 155–165.

PLDI-2009-MehraraHHM #hardware #low cost #memory management #transaction #using

Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory (MM, JH, PCH, SAM), pp. 166–176.

PLDI-2009-TournavitisWFO #approach #detection #parallel #towards

Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping (GT, ZW, BF, MFPO), pp. 177–187.

PLDI-2009-HooimeijerW #constraints #regular expression #set

A decision procedure for subset constraints over regular languages (PH, WW), pp. 188–198.

PLDI-2009-SchwerdfegerW #composition

Verifiable composition of deterministic grammars (AS, EVW), pp. 199–210.

PLDI-2009-TorreMP #calculus #fixpoint #recursion #source code #using

Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.

PLDI-2009-SrivastavaG #abstraction #using #verification

Program verification using templates over predicate abstraction (SS, SG), pp. 223–234.

PLDI-2009-AftandilianG #garbage collection #using

GC assertions: using the garbage collector to check heap properties (EA, SZG), pp. 235–244.

PLDI-2009-NagarakatteZMZ #bound #c #memory management #named #safety

SoftBound: highly compatible and complete spatial memory safety for c (SN, JZ, MMKM, SZ), pp. 245–258.

PLDI-2009-Oiwa #compilation #implementation

Implementation of the memory-safe full ANSI-C compiler (YO), pp. 259–269.

PLDI-2009-Rubio-GonzalezGLAA #analysis #fault #file system

Error propagation analysis for file systems (CRG, HSG, BL, RHAD, ACAD), pp. 270–280.

PLDI-2009-QiM #product line

Sharing classes between families (XQ, ACM), pp. 281–292.

PLDI-2009-RendelOH #self

Typed self-representation (TR, KO, CH), pp. 293–303.

PLDI-2009-KawaguchiRJ #data type #type system #verification

Type-based data structure verification (MK, PMR, RJ), pp. 304–315.

PLDI-2009-TristanL #lazy evaluation #validation

Verified validation of lazy code motion (JBT, XL), pp. 316–326.

PLDI-2009-KunduTL #equivalence #optimisation #proving #using

Proving optimizations correct using parameterized program equivalence (SK, ZT, SL), pp. 327–337.

PLDI-2009-ZeeKR #imperative #proving #source code

An integrated proof language for imperative programs (KZ, VK, MCR), pp. 338–351.

PLDI-2009-RavitchJAL #automation #generative #library #static analysis #using

Automatic generation of library bindings using static analysis (TR, SJ, EA, BL), pp. 352–362.

PLDI-2009-ChandraFS #approach #named

Snugglebug: a powerful approach to weakest preconditions (SC, SJF, MS), pp. 363–374.

PLDI-2009-GulwaniJK #analysis #bound #control flow #invariant #refinement

Control-flow refinement and progress invariants for bound analysis (SG, SJ, EK), pp. 375–385.

PLDI-2009-InoueKN #case study #manycore #memory management

A study of memory management for web-based applications on multicore processors (HI, HK, TN), pp. 386–396.

PLDI-2009-NovarkBZ #memory management

Efficiently and precisely locating memory leaks and bloat (GN, EDB, BGZ), pp. 397–407.

PLDI-2009-ShachamVY #adaptation #named

Chameleon: adaptive selection of collections (OS, MTV, EY), pp. 408–418.

PLDI-2009-XuAMRS #profiling #runtime

Go with the flow: profiling copies to find runtime bloat (G(X, MA, NM, AR, GS), pp. 419–430.

PLDI-2009-SahaZCGYRFZRM #framework #platform #programming

Programming model for a heterogeneous x86 platform (BS, XZ, HC, YG, SY, MR, JF, PZ, RR, AM), pp. 431–440.

PLDI-2009-TallentMF #analysis #metric #performance

Binary analysis for measurement and attribution of program performance (NRT, JMMC, MWF), pp. 441–452.

PLDI-2009-HoffmanEJ #analysis #semantics

Semantics-aware trace analysis (KJH, PE, SJ), pp. 453–464.

PLDI-2009-GalESAMHKHZORSRBCF

Trace-based just-in-time type specialization for dynamic languages (AG, BE, MS, DA, DM, MRH, BK, GH, BZ, JO, JR, EWS, RR, MB, MC, MF), pp. 465–478.