Hans-Juergen Boehm, Cormac Flanagan
Proceedings of the 34th Conference on Programming Language Design and Implementation
PLDI, 2013.

@proceedings{PLDI-2013,
	acmid         = "2491956",
	address       = "Seattle, Washington, USA",
	editor        = "Hans-Juergen Boehm and Cormac Flanagan",
	isbn          = "978-1-4503-2014-6",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 34th Conference on Programming Language Design and Implementation}",
	year          = 2013,
}

Contents (48 items)

11 ×#named
4 ×#analysis
4 ×#optimisation
4 ×#programming
3 ×#compilation
3 ×#concurrent
3 ×#multi
3 ×#performance
3 ×#source code
3 ×#verification

PLDI-2013-Larus #exclamation #in the cloud

Look up!: your future is in the cloud (JRL), pp. 1–2.

PLDI-2013-CheungSM #optimisation #query #synthesis

Optimizing database-backed applications with query synthesis (AC, ASL, SM), pp. 3–14.

PLDI-2013-SinghGS #automation #feedback #generative #programming

Automated feedback generation for introductory programming assignments (RS, SG, ASL), pp. 15–26.

PLDI-2013-GveroKKP #using

Complete completion using types and weights (TG, VK, IK, RP), pp. 27–38.

PLDI-2013-JohnsonOZA #dependence #graph #performance

Fast condensation of the program dependence graph (NPJ, TO, AZ, DIA), pp. 39–50.

PLDI-2013-ElwazeerAKSB #data type #detection #scalability

Scalable variable and data type detection in a binary rewriter (KE, KA, AK, MS, RB), pp. 51–60.

PLDI-2013-RajaramNSE #implementation #performance #semantics

Fast RMWs for TSO: semantics and implementation (BR, VN, SS, ME), pp. 61–72.

PLDI-2013-GordonEG #alias #refinement

Rely-guarantee references for refinement types over aliased mutable data (CSG, MDE, DG), pp. 73–84.

PLDI-2013-Titzer #parametricity #tuple

Harmonizing classes, functions, tuples, and type parameters in virgil iii (BT), pp. 85–94.

PLDI-2013-BurckhardtFHMMTK #exclamation #feedback #programming #user interface

It’s alive! continuous feedback in UI programming (SB, MF, PdH, SM, MM, NT, JK), pp. 95–104.

PLDI-2013-DeVitoHAHV #multi #named

Terra: a multi-stage language for high-performance computing (ZD, JH, AA, PH, JV), pp. 105–116.

PLDI-2013-LiTCS #adaptation #multi #named

SMAT: an input adaptive auto-tuner for sparse matrix-vector multiplication (JL, GT, MC, NS), pp. 117–126.

PLDI-2013-KongVSFPS #code generation

When polyhedral transformations meet SIMD code generation (MK, RV, KS, FF, LNP, PS), pp. 127–138.

PLDI-2013-Schneider #programming language #security

Programming languages in security: keynote (FBS), pp. 139–140.

PLDI-2013-HuangZD #concurrent #named

CLAP: recording local executions to reproduce concurrency failures (JH, CZ, JD), pp. 141–152.

PLDI-2013-ElmasBNS #concurrent #debugging #domain-specific language #named

CONCURRIT: a domain specific language for reproducing concurrency bugs (TE, JB, GCN, KS), pp. 153–164.

PLDI-2013-SchaferSDT #analysis

Dynamic determinacy analysis (MS, MS, JD, FT), pp. 165–174.

PLDI-2013-ZhaoNMZ #optimisation #verification

Formal verification of SSA-based optimizations for LLVM (JZ, SN, MMKM, SZ), pp. 175–186.

PLDI-2013-MorissetPN #compilation #formal method #memory management #optimisation #testing

Compiler testing via a theory of sound optimisations in the C11/C++11 memory model (RM, PP, FZN), pp. 187–196.

PLDI-2013-ChenGZWFER #compilation #fuzzing

Taming compiler fuzzers (YC, AG, CZ, WKW, XF, EE, JR), pp. 197–208.

PLDI-2013-BlackshearL #composition #framework #semantics #specification

Almost-correct specifications: a modular semantic framework for assigning confidence to warnings (SB, SKL), pp. 209–218.

PLDI-2013-CookK #nondeterminism #reasoning #source code

Reasoning about nondeterminism in programs (BC, EK), pp. 219–230.

PLDI-2013-Qiu0SM #proving

Natural proofs for structure, data, and separation (XQ, PG, AS, PM), pp. 231–242.

PLDI-2013-YuKL #data type #multi #thread

General data structure expansion for multi-threading (HY, HJK, ZL), pp. 243–252.

PLDI-2013-HungG #monitoring #named

AutoSynch: an automatic-signal monitor based on predicate tagging (WLH, VKG), pp. 253–262.

PLDI-2013-Golan-GuetaRSY #concurrent #library

Concurrent libraries with foresight (GGG, GR, MS, EY), pp. 263–274.

PLDI-2013-BlackshearCS #named #precise #reachability

Thresher: precise refutations for heap reachability (SB, BYEC, MS), pp. 275–286.

PLDI-2013-UdupaRDMMA #named #protocol #specification

TRANSIT: specifying protocols with concolic snippets (AU, AR, JVD, SMH, MMKM, RA), pp. 287–296.

PLDI-2013-GaoSBMBL #runtime #smarttech #using

Using managed runtime systems to tolerate holes in wearable memories (TG, KS, SMB, KSM, DB, JRL), pp. 297–308.

PLDI-2013-CohenP #bound #towards

Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.

PLDI-2013-DesaiGJQRZ #named #programming

P: safe asynchronous event-driven programming (AD, VG, EKJ, SQ, SKR, DZ), pp. 321–332.

PLDI-2013-GreenLRSV #named #programming language #quantum #scalability

Quipper: a scalable quantum programming language (ASG, PLL, NJR, PS, BV), pp. 333–342.

PLDI-2013-IsradisaikulM #pattern matching

Reconciling exhaustive pattern matching with objects (CI, ACM), pp. 343–354.

PLDI-2013-BoddenTRBBM #named #product line

SPL^LIFT: statically analyzing software product lines in minutes instead of years (EB, TT, MR, CB, PB, MM), pp. 355–364.

PLDI-2013-ZhangNY #abstraction #analysis #data flow #parametricity

Finding optimum abstractions in parametric dataflow analysis (XZ, MN, HY), pp. 365–376.

PLDI-2013-ApinisSV #equation #how

How to combine widening and narrowing for non-monotonic systems of equations (KA, HS, VV), pp. 377–386.

PLDI-2013-SwamyWSCL #higher-order #monad #source code #verification

Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.

PLDI-2013-SergeyDMMDCP #monad

Monadic abstract interpreters (IS, DD, MM, JM, DD, DC, FP), pp. 399–410.

PLDI-2013-CzaplickiC #functional #programming #user interface

Asynchronous functional reactive programming for GUIs (EC, SC), pp. 411–422.

PLDI-2013-KastrinisS #analysis #context-sensitive grammar #hybrid #points-to

Hybrid context-sensitivity for points-to analysis (GK, YS), pp. 423–434.

PLDI-2013-ZhangLYS #algorithm #alias #analysis #performance

Fast algorithms for Dyck-CFL-reachability with applications to alias analysis (QZ, MRL, HY, ZS), pp. 435–446.

PLDI-2013-SankaranarayananCG #probability #source code #static analysis

Static analysis for probabilistic programs: inferring whole program properties from finitely many paths (SS, AC, SG), pp. 447–458.

PLDI-2013-LiangF #composition #verification

Modular verification of linearizability with non-fixed linearization points (HL, XF), pp. 459–470.

PLDI-2013-SewellMK #kernel #validation

Translation validation for a verified OS kernel (TALS, MOM, GK), pp. 471–482.

PLDI-2013-GuhaRF #network

Machine-verified network controllers (AG, MR, NF), pp. 483–494.

PLDI-2013-NowatzkiSCSER #architecture #constraints #framework #scheduling

A general constraint-centric scheduling framework for spatial architectures (TN, MST, LDC, KS, CE, BR), pp. 495–506.

PLDI-2013-LifflanderKK

Steal Tree: low-overhead tracing of work stealing schedulers (JL, SK, LVK), pp. 507–518.

PLDI-2013-Ragan-KelleyBAPDA #compilation #image #locality #named #optimisation #parallel #pipes and filters

Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines (JRK, CB, AA, SP, FD, SPA), pp. 519–530.