default search action
PLDI 2015: Portland, OR, USA
- David Grove, Stephen M. Blackburn:
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, June 15-17, 2015. ACM 2015, ISBN 978-1-4503-3468-6
Distinguished Papers
- Pavel Panchekha, Alex Sanchez-Stern, James R. Wilcox, Zachary Tatlock
:
Automatically improving accuracy for floating point expressions. 1-11 - Danfeng Zhang
Diagnosing type errors with class. 12-21 - Nuno P. Lopes
Provably correct peephole optimizations with alive. 22-32
Correctness
- Maarten Faddegon, Olaf Chitil:
Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack. 33-42 - Stelios Sidiroglou-Douskos, Eric Lahtinen, Fan Long, Martin C. Rinard:
Automatic error elimination by horizontal code transfer across multiple applications. 43-54 - Peng Liu, Xiangyu Zhang, Omer Tripp, Yunhui Zheng:
Light: replay via tightly bounded recording. 55-64 - Christopher Lidbury, Andrei Lascu, Nathan Chong
Many-core compiler fuzzing. 65-76
Verification
- Ilya Sergey
Mechanized verification of fine-grained concurrent programs. 77-87 - Rahul Sharma, Michael Bauer, Alex Aiken
Verification of producer-consumer synchronization in GPU programs. 88-98 - Peter Gammie, Antony L. Hosking
Relaxing safely: verified on-the-fly garbage collection for x86-TSO. 99-109 - Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis
Verifying read-copy-update in a logic for weak memory. 110-120
Optimization
- Yousun Ko, Bernd Burgstaller, Bernhard Scholz:
LaminarIR: compile-time queues for structured streams. 121-130 - Wei Ding, Xulong Tang
Optimizing off-chip accesses in multicores. 131-142 - Sanyam Mehta, Pen-Chung Yew
Improving compiler scalability: optimizing large programs at small price. 143-152
TOPLAS
- Andrew W. Appel
Verification of a cryptographic primitive: SHA-256 (abstract). 153
Concurrency I
- Pantazis Deligiannis
Asynchronous programming, analysis and testing with state machines. 154-164 - Jeff Huang:
Stateless model checking concurrent programs with maximal causality reduction. 165-174 - Malavika Samak, Murali Krishna Ramanathan, Suresh Jagannathan:
Synthesizing racy tests. 175-185 - Eric Koskinen, Matthew J. Parkinson:
The Push/Pull model of transactions. 186-195
Synthesis I
- Jedidiah McClurg, Hossein Hojjat, Pavol Cerný, Nate Foster:
Efficient synthesis of network updates. 196-207 - Aditya V. Nori, Sherjil Ozair, Sriram K. Rajamani, Deepak Vijaykeerthy:
Efficient synthesis of probabilistic programs. 208-217 - Daniel W. Barowy, Sumit Gulwani, Ted Hart, Benjamin G. Zorn:
FlashRelate: extracting relational data from semi-structured spreadsheets using examples. 218-228 - John K. Feser
Synthesizing data structure transformations from input-output examples. 229-239
Concurrency II
- Ofri Ziv, Alex Aiken
Composing concurrency control. 240-249 - Naling Zhang, Markus Kusano, Chao Wang:
Dynamic partial order reduction for relaxed memory models. 250-259 - Michael Emmi, Constantin Enea, Jad Hamza:
Monitoring refinement via symbolic reasoning. 260-269 - Stephen Longfield Jr., Brittany Nkounkou, Rajit Manohar, Ross Tate:
Preventing glitches and short circuits in high-level self-timed chip specifications. 270-279
Analysis
- Akash Lal, Shaz Qadeer:
DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs. 280-290 - Andrew Johnson, Lucas Waye, Scott Moore, Stephen Chong:
Exploring and enforcing security guarantees via program dependence graphs. 291-302 - Gagandeep Singh
Making numerical program analysis fast. 303-313 - Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu, Milind Kulkarni:
Tree dependence analysis. 314-325
Semantics I
- Jeehoon Kang
A formal C memory model supporting integer-pointer casts. 326-335 - Chris Hathhorn
Defining the undefinedness of C. 336-345 - Daejun Park, Andrei Stefanescu, Grigore Rosu:
KJS: a complete formal semantics of JavaScript. 346-356 - James R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock
Verdi: a framework for implementing and formally verifying distributed systems. 357-368
Performance
- Oswaldo Olivo, Isil Dillig, Calvin Lin:
Static detection of asymptotic performance bugs in collection traversals. 369-378 - Yufei Ding, Jason Ansel, Kalyan Veeramachaneni, Xipeng Shen
Autotuning algorithmic choice for input sensitivity. 379-390 - Charith Mendis, Jeffrey Bosboom
Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code. 391-402 - William J. Bowman
Profile-guided meta-programming. 403-412
Semantics II
- K. C. Sivaramakrishnan, Gowtham Kaki
Declarative programming over eventually consistent data stores. 413-424 - Jeremy G. Siek
Blame and coercion: together again for the first time. 425-435 - Yizhou Zhang
Lightweight, flexible object-oriented generics. 436-445 - Phuc C. Nguyen, David Van Horn
Relatively complete counterexamples for higher-order programs. 446-456
Logic
- Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh
Automatic induction proofs of data-structures in imperative programs. 457-466 - Quentin Carbonneaux, Jan Hoffmann, Zhong Shao
Compositional certified resource bounds. 467-478 - Karl Crary, Michael J. Sullivan
Peer-to-peer affine commitment using bitcoin. 479-488 - Ton Chanh Le, Shengchao Qin
Termination and non-termination specification inference. 489-498
Parallelism
- Murali Krishna Emani, Michael F. P. O'Boyle:
Celebrating diversity: a mixture of experts approach for runtime mapping in dynamic environments. 499-508 - Bin Ren, Youngjoon Jo, Sriram Krishnamoorthy
Efficient execution of recursive programs on commodity vector hardware. 509-520 - Anand Venkat, Mary W. Hall
Loop and data transformations for sparse matrix code. 521-532 - Dimitrios Prountzos, Roman Manevich, Keshav Pingali:
Synthesizing parallel graph programs via automated planning. 533-544
Potpourri
- Stefan Marr
Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises. 545-554 - Chinawat Isradisaikul, Andrew C. Myers:
Finding counterexamples from parsing conflicts. 555-564 - Alan Leung, John Sarracino
Interactive parser synthesis by example. 565-574 - Brandon Lucia, Benjamin Ransford:
A simpler, safer programming and execution model for intermittent systems. 575-585
Synthesis II
- Nuno Machado
Concurrency debugging with differential schedule projections. 586-595 - Venkatesh Srinivasan, Thomas W. Reps:
Synthesis of machine code from semantics. 596-607 - Laure Gonnord, David Monniaux
Synthesis of ranking functions using extremal counterexamples. 608-618 - Peter-Michael Osera, Steve Zdancewic:
Type-and-example-directed program synthesis. 619-630
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: