Proceedings of the 39th 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

Jeffrey S. Foster, Dan Grossman
Proceedings of the 39th Conference on Programming Language Design and Implementation
PLDI, 2018.

PLT
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{PLDI-2018,
	doi           = "10.1145/3192366",
	editor        = "Jeffrey S. Foster and Dan Grossman",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 39th Conference on Programming Language Design and Implementation}",
	year          = 2018,
}

Contents (55 items)

PLDI-2018-PanchekhaGETK #layout #verification #web
Verifying that web pages have accessible layout (PP, ATG, MDE, ZT, SK), pp. 1–14.
PLDI-2018-VilkB #automation #debugging #memory management #named #web
BLeak: automatically debugging memory leaks in web applications (JV, EDB), pp. 15–29.
PLDI-2018-BaxterNPKG #execution #javascript
Putting in all the stops: execution control for JavaScript (SB, RN, JGP, SK, AG), pp. 30–45.
PLDI-2018-GogteDWNCW
Persistency for synchronization-free regions (VG, SD, WW, SN, PMC, TFW), pp. 46–61.
PLDI-2018-AkramSME #garbage collection #hybrid
Write-rationing garbage collection for hybrid memories (SA, JBS, KSM, LE), pp. 62–77.
PLDI-2018-LinWCLDW #architecture #manycore #network
Mapping spiking neural networks onto a manycore neuromorphic architecture (CKL, AW, GNC, THL, MD, HW), pp. 78–89.
PLDI-2018-BrutschyD0V #analysis #consistency
Static serializability analysis for causal consistency (LB, DD, PM0, MTV), pp. 90–104.
PLDI-2018-LiuW #analysis #bound #concurrent #interprocedural #named #source code
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs (PL, TW), pp. 105–119.
PLDI-2018-FerlesGDS #automation #reasoning
Symbolic reasoning for automatic signal placement (KF, JVG, ID, YS), pp. 120–134.
PLDI-2018-ChenHLLTTZ #algorithm #termination
Advanced automata-based algorithms for program termination checking (YFC, MH, OL, YL0, MHT, AT, LZ0), pp. 135–150.
PLDI-2018-Ottoni #compilation #jit #php
HHVM JIT: a profile-guided, region-based compiler for PHP and Hack (GO), pp. 151–165.
PLDI-2018-DEliaD
On-stack replacement, distilled (DCD, CD), pp. 166–180.
PLDI-2018-DuckY #c #c++ #detection #effectiveness #fault #memory management #named #using
EffectiveSan: type and memory error detection using dynamically typed C/C++ (GJD, RHCY), pp. 181–195.
PLDI-2018-CaiZZNXS #constraints
Calling-to-reference context translation via constraint-guided CFL-reachability (CC, QZ, ZZ0, KN, GHX, ZS), pp. 196–210.
PLDI-2018-ChongSW #c++ #memory management #semantics #transaction
The semantics of transactions and weak memory in x86, Power, ARM, and C++ (NC, TS0, JW), pp. 211–225.
PLDI-2018-MilanoM #consistency #named #transaction
MixT: a language for mixing consistency in geodistributed transactions (MM, ACM), pp. 226–241.
PLDI-2018-DolanSM #bound
Bounding data races in space and time (SD, KCS, AM), pp. 242–255.
PLDI-2018-Sanchez-SternPL #fault #float
Finding root causes of floating point error (ASS, PP, SL, ZT), pp. 256–269.
PLDI-2018-Adams #float #named #performance #string
Ryū: fast float-to-string conversion (UA), pp. 270–282.
PLDI-2018-SteindorferV #exclamation #functional #multi #performance
To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-tries (MJS, JJV), pp. 283–295.
PLDI-2018-KoeplingerFPZHF #compilation #named
Spatial: a language and compiler for application accelerators (DK, MF, RP, YZ, SH, RF, TZ, LN, AP, CK, KO), pp. 296–311.
PLDI-2018-KislalKTKJ #physics
Enhancing computation-to-core assignment with physical location information (OK, JK, XT, MTK, MJ), pp. 312–327.
PLDI-2018-TranJCKSK #co-evolution #design #named
SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order cores (KAT, AJ, TEC, KK, MS, SK), pp. 328–343.
PLDI-2018-LiuSWTL #named #parallel #thread
iReplayer: in-situ and identical record-and-replay for multithreaded applications (HL, SS, WW, CT0, TL), pp. 344–358.
PLDI-2018-LiuH #analysis #concurrent #debugging #difference #named #parallel #performance
D4: fast concurrency debugging with parallel differential analysis (BL, JH0), pp. 359–373.
PLDI-2018-RoemerGB #bound #concurrent #detection #predict
High-coverage, unbounded sound predictive race detection (JR, KG, MDB), pp. 374–389.
PLDI-2018-PengGD #detection #named
CURD: a dynamic CUDA race detector (YP, VG, JD), pp. 390–403.
PLDI-2018-0002ZLY #predict #representation
A general path-based representation for predicting program properties (UA0, MZ, OL, EY), pp. 404–419.
PLDI-2018-FengMBD #learning #synthesis #using
Program synthesis using conflict-driven learning (YF, RM, OB, ID), pp. 420–435.
PLDI-2018-LeeHAN #modelling #probability #search-based #synthesis #using
Accelerating search-based program synthesis using learned probabilistic models (WL, KH, RA, MN), pp. 436–449.
PLDI-2018-PaletovTRV #api
Inferring crypto API rules from code changes (RP, PT, VR, MTV), pp. 450–464.
PLDI-2018-GulwaniRZ #automation #clustering #program repair #programming
Automated clustering and program repair for introductory programming assignments (SG, IR, FZ), pp. 465–480.
PLDI-2018-WangSS #data-driven #feedback #generative #programming
Search, align, and repair: data-driven feedback generation for introductory programming exercises (KW0, RS, ZS), pp. 481–495.
PLDI-2018-NgoC0 #analysis #bound #probability #source code
Bounded expectations: resource analysis for probabilistic programs (VCN, QC, JH0), pp. 496–512.
PLDI-2018-WangHR #algebra #framework #named #probability #source code #static analysis
PMAF: an algebraic framework for static analysis of probabilistic programs (DW, JH0, TWR), pp. 513–528.
PLDI-2018-AcharyaB0 #integer #linear #programming
Polyhedral auto-transformation with no integer linear programming (AA, UB, AC0), pp. 529–542.
PLDI-2018-MollH #control flow
Partial control-flow linearization (SM, SH), pp. 543–556.
PLDI-2018-ChenLDP #analysis #locality #parallel
Locality analysis through static parallel sampling (DC, FL, CD, SP), pp. 557–570.
PLDI-2018-Cusumano-Towner18a #incremental #probability #source code
Incremental inference for probabilistic programs (MCT, BB, TG, MTV, VKM), pp. 571–585.
PLDI-2018-GehrMTVWV #named #network #probability
Bayonet: probabilistic inference for networks (TG, SM, PT, LV, PW, MTV), pp. 586–602.
PLDI-2018-MansinghkaSHRCR #probability #programmable #programming
Probabilistic programming with programmable inference (VKM, US, SH, AR, YC, MR), pp. 603–616.
PLDI-2018-BohrerTMMP #bytecode #cyber-physical #modelling #named
VeriPhy: verified controller executables from verified cyber-physical system models (BB, YKT, SM, MOM, AP), pp. 617–630.
PLDI-2018-KangKSLPSKCCHY #compilation #named
Crellvm: verified credible compilation for LLVM (JK, YK, YS, JL, SP, MDS, YK, SC, JC, CKH, KY), pp. 631–645.
PLDI-2018-GuSKWKS0CR #abstraction #concurrent
Certified concurrent abstraction layers (RG, ZS, JK, X(W, JK, VS, HC0, DC, TR), pp. 646–661.
PLDI-2018-TaubeLMPSSWW #composition #decidability #deduction #distributed #verification
Modularity for decidability of deductive verification with applications to distributed systems (MT, GL, KLM, OP, MS, SS, JRW, DW), pp. 662–677.
PLDI-2018-Bastani0AL #learning #points-to #specification
Active learning of points-to specifications (OB, RS0, AA, PL), pp. 678–692.
PLDI-2018-ShiXWZFZ #analysis #named #performance #precise
Pinpoint: fast and precise sparse value flow analysis for million lines of code (QS, XX0, RW, JZ, GF, CZ), pp. 693–706.
PLDI-2018-ZhuMJ #data-driven
A data-driven CHC solver (HZ0, SM, SJ), pp. 707–721.
PLDI-2018-RaghothamanKHN #reasoning #using
User-guided program reasoning using Bayesian inference (MR, SK, KH, MN), pp. 722–735.
PLDI-2018-HongSKRKPRS #analysis #gpu #kernel #optimisation #using
GPU code optimization using abstract kernel emulation and sensitivity analysis (CH, ASR, JK, PSR, SK, LNP, FR, PS), pp. 736–751.
PLDI-2018-DathathriGHDBDS #distributed #graph #named
Gluon: a communication-optimizing substrate for distributed heterogeneous graph analytics (RD, GG, LH, HVD, AB, ND, MS, KP), pp. 752–768.
PLDI-2018-AcarCGRS #parallel #performance #scheduling
Heartbeat scheduling: provable efficiency for nested parallelism (UAA, AC, AG, MR, FS), pp. 769–782.
PLDI-2018-SerranoHVJ #morphism #polymorphism
Guarded impredicative polymorphism (AS0, JH, DV, SPJ), pp. 783–796.
PLDI-2018-BowmanA #calculus
Typed closure conversion for the calculus of constructions (WJB, AA), pp. 797–811.
PLDI-2018-PombrioK
Inferring type rules for syntactic sugar (JP, SK), pp. 812–825.

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.