Proceedings of the 32nd Conference on Programming Language Design and Implementation
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Mary W. Hall, David A. Padua
Proceedings of the 32nd Conference on Programming Language Design and Implementation
PLDI, 2011.

PLT
DBLP
Scholar
Full names Links ISxN
@proceedings{PLDI-2011,
	address       = "San Jose, California, USA",
	editor        = "Mary W. Hall and David A. Padua",
	isbn          = "978-1-4503-0663-8",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 32nd Conference on Programming Language Design and Implementation}",
	year          = 2011,
}

Contents (55 items)

PLDI-2011-PrabhuGZJA #commutative #parallel #programming #set
Commutative set: a language extension for implicit parallel programming (PP, SG, YZ, NPJ, DIA), pp. 1–11.
PLDI-2011-PingaliNKBHKLLMMPS #algorithm #parallel
The tao of parallelism in algorithms (KP, DN, MK, MB, MAH, RK, THL, AL, RM, MML, DP, XS), pp. 12–25.
PLDI-2011-RamanKOLA #distributed #parallel #using
Parallelism orchestration using DoPE: the degree of parallelism executive (AR, HK, TO, JWL, DIA), pp. 26–37.
PLDI-2011-HawkinsAFRS #data transformation #representation #synthesis
Data representation synthesis (PH, AA, KF, MCR, MS), pp. 38–49.
PLDI-2011-GulwaniKT #geometry
Synthesizing geometry constructions (SG, VAK, AT), pp. 50–61.
PLDI-2011-GulwaniJTV #source code #synthesis
Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
PLDI-2011-BohmKKFT #compilation #parallel #using
Generalized just-in-time trace compilation using a parallel task farm in a dynamic binary translator (IB, TJKEvK, SCK, BF, NPT), pp. 74–85.
PLDI-2011-JungRRCP #data type #effectiveness #named
Brainy: effective selection of data structures (CJ, SR, BPR, NC, SP), pp. 86–97.
PLDI-2011-ZhouCC #algorithm #execution
An SSA-based algorithm for optimal speculative code motion under an execution profile (HZ, WC, FCC), pp. 98–108.
PLDI-2011-LiTOKCSH #data flow #hardware #named
Caisson: a hardware description language for secure information flow (XL, MT, JO, VK, FTC, TS, BH), pp. 109–120.
PLDI-2011-MurrayIY #automation #declarative #named #optimisation #query
Steno: automatic optimization of declarative queries (DGM, MI, YY), pp. 121–131.
PLDI-2011-Tobin-HochstadtSCFF #library
Languages as libraries (STH, VSA, RC, MF, MF), pp. 132–141.
PLDI-2011-JablinPJJBA #automation #communication #cpu #gpu #optimisation
Automatic CPU-GPU communication management and optimization (TBJ, PP, JAJ, NPJ, SRB, DIA), pp. 142–151.
PLDI-2011-PrasadAG #automation #compilation #execution #matlab #source code
Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors (AP, JA, RG), pp. 152–163.
PLDI-2011-SampsonDFGCG #approximate #data type #named #power management
EnerJ: approximate data types for safe and general low-power computation (AS, WD, EF, DG, LC, DG), pp. 164–174.
PLDI-2011-SarkarSAMW #comprehension #multi
Understanding POWER multiprocessors (SS, PS, JA, LM, DW), pp. 175–186.
PLDI-2011-KupersteinVY #abstraction #memory management #modelling
Partial-coherence abstractions for relaxed memory models (MK, MTV, EY), pp. 187–198.
PLDI-2011-MarinoSMMN #compilation
A case for an SC-preserving compiler (DM, AS, TDM, MM, SN), pp. 199–210.
PLDI-2011-BeckmanN #composition #probability #scalability #specification #type system
Probabilistic, modular and scalable inference of typestate specifications (NEB, AVN), pp. 211–221.
PLDI-2011-KobayashiSU #abstraction #higher-order #model checking
Predicate abstraction and CEGAR for higher-order model checking (NK, RS, HU), pp. 222–233.
PLDI-2011-Chlipala #logic #low level #source code #verification
Mostly-automated verification of low-level programs in computational separation logic (AC), pp. 234–245.
PLDI-2011-LeeZSZ #generative #towards
Toward generating reducible replay logs (KHL, YZ, NS, XZ), pp. 246–257.
PLDI-2011-Godefroid #generative #higher-order #testing
Higher-order test generation (PG), pp. 258–269.
PLDI-2011-XuBQR #memory management #named
LeakChaser: helping programmers narrow down causes of memory leaks (G(X, MDB, FQ, AR), pp. 270–282.
PLDI-2011-YangCER #c #compilation #comprehension #debugging
Finding and understanding bugs in C compilers (XY, YC, EE, JR), pp. 283–294.
PLDI-2011-TristanGM #validation
Evaluating value-graph translation validation for LLVM (JBT, PG, GM), pp. 295–305.
PLDI-2011-Sevcik #concurrent #optimisation #source code
Safe optimisations for shared-memory concurrent programs (JS), pp. 306–316.
PLDI-2011-HarrisG #spreadsheet
Spreadsheet table transformations from examples (WRH, SG), pp. 317–328.
PLDI-2011-MengKM #editing #generative #program transformation
Systematic editing: generating program transformations from an example (NM, MK, KSM), pp. 329–342.
PLDI-2011-SrivastavaBMS #api #detection #implementation #multi #policy #security #using
A security policy oracle: detecting security holes using multiple API implementations (VS, MDB, KSM, VS), pp. 343–354.
PLDI-2011-AnselMETCSSBY #compilation #independence #self
Language-independent sandboxing of just-in-time compilation and self-modifying code (JA, PM, ÚE, ET, BC, DLS, DS, CB, BY), pp. 355–366.
PLDI-2011-ZengWL #concurrent #data type #monitoring #named #using
Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures (QZ, DW, PL), pp. 367–377.
PLDI-2011-LuciaWC #comprehension #concurrent #execution #fault #using
Isolating and understanding concurrency errors using reconstructed execution fragments (BL, BPW, LC), pp. 378–388.
PLDI-2011-JinSZLL #automation
Automated atomicity-violation fixing (GJ, LS, WZ, SL, BL), pp. 389–400.
PLDI-2011-BurnimENS #correctness #named #nondeterminism #parallel #runtime #specification
NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctness (JB, TE, GCN, KS), pp. 401–414.
PLDI-2011-JinMGR #garbage collection #monitoring #parametricity
Garbage collection for monitoring parametric properties (DJ, POM, DG, GR), pp. 415–424.
PLDI-2011-ParrF #generative #ll #parsing
LL(*): the foundation of the ANTLR parser generator (TP, KF), pp. 425–436.
PLDI-2011-JoseM #fault #locality #satisfiability #using
Cause clue clauses: error localization using maximum satisfiability (MJ, RM), pp. 437–446.
PLDI-2011-BudiLJL #behaviour #debugging #named
kb-anonymity: a model for anonymized behaviour-preserving test and debugging data (AB, DL, LJ, L), pp. 447–457.
PLDI-2011-GarciaJLT #manycore #named
Kremlin: rethinking and rebooting gprof for the multicore age (SG, DJ, CML, MBT), pp. 458–469.
PLDI-2011-SatoI #automation #matrix #parallel
Automatic parallelization via matrix multiplication (SS, HI), pp. 470–479.
PLDI-2011-UdupaRT #dependence #named #parallel
ALTER: exploiting breakable dependences for parallelization (AU, KR, WT), pp. 480–491.
PLDI-2011-SrivastavaGCF #induction #synthesis
Path-based inductive synthesis for program inversion (SS, SG, SC, JSF), pp. 492–503.
PLDI-2011-PersonYRK #execution #incremental #symbolic computation
Directed incremental symbolic execution (SP, GY, NR, SK), pp. 504–515.
PLDI-2011-DEliaDF #mining
Mining hot calling contexts in small space (DCD, CD, IF), pp. 516–527.
PLDI-2011-KimR #commutative #data type #linked data #open data #semantics #verification
Verification of semantic commutativity conditions and inverse operations on linked data structures (DK, MCR), pp. 528–541.
PLDI-2011-KulkarniNPSP #commutative
Exploiting the commutativity lattice (MK, DN, DP, XS, KP), pp. 542–555.
PLDI-2011-PerezR #calculus #logic #proving #theorem proving
Separation logic + superposition calculus = heap theorem prover (JANP, AR), pp. 556–566.
PLDI-2011-DilligDAS #composition #precise #source code #summary
Precise and compact modular procedure summaries for heap manipulating programs (ID, TD, AA, MS), pp. 567–577.
PLDI-2011-BouajjaniDES #analysis #interprocedural #on the #source code
On inter-procedural analysis of programs with lists and data (AB, CD, CE, MS), pp. 578–589.
PLDI-2011-LiangN #abstraction #refinement #scalability
Scaling abstraction refinement via pruning (PL, MN), pp. 590–601.
PLDI-2011-AltidorHS
Taming the wildcards: combining definition- and use-site variance (JA, SSH, YS), pp. 602–613.
PLDI-2011-TateLL #java #type system
Taming wildcards in Java’s type system (RT, AL, SL), pp. 614–627.
PLDI-2011-ZiarekSJ #composition
Composable asynchronous events (LZ, KCS, SJ), pp. 628–639.
PLDI-2011-BestMMRFB #scheduling
Synchronization via scheduling: techniques for efficiently managing shared state (MJB, SM, CM, MR, AF, AB), pp. 640–652.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.