default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPLDI 2013: Seattle, WA, USA
- Hans-Juergen Boehm, Cormac Flanagan:
ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '13, Seattle, WA, USA, June 16-19, 2013. ACM 2013, ISBN 978-1-4503-2014-6
Keynote address
- James R. Larus:
Look up!: your future is in the cloud. 1-2
Synthesis
- Alvin Cheung
, Armando Solar-Lezama, Samuel Madden:
Optimizing database-backed applications with query synthesis. 3-14 - Rishabh Singh, Sumit Gulwani, Armando Solar-Lezama:
Automated feedback generation for introductory programming assignments. 15-26 - Tihomir Gvero, Viktor Kuncak, Ivan Kuraj, Ruzica Piskac:
Complete completion using types and weights. 27-38
Low level issues
- Nick P. Johnson, Taewook Oh, Ayal Zaks, David I. August:
Fast condensation of the program dependence graph. 39-50 - Khaled Elwazeer, Kapil Anand, Aparna Kotha, Matthew Smithson, Rajeev Barua:
Scalable variable and data type detection in a binary rewriter. 51-60 - Bharghava Rajaram, Vijay Nagarajan, Susmit Sarkar, Marco Elver:
Fast RMWs for TSO: semantics and implementation. 61-72
Types
- Colin S. Gordon, Michael D. Ernst, Dan Grossman:
Rely-guarantee references for refinement types over aliased mutable data. 73-84 - Ben L. Titzer:
Harmonizing classes, functions, tuples, and type parameters in virgil iii. 85-94 - Sebastian Burckhardt, Manuel Fähndrich, Peli de Halleux, Sean McDirmid, Michal Moskal, Nikolai Tillmann, Jun Kato:
It's alive! continuous feedback in UI programming. 95-104
High performance computing
- Zachary DeVito, James Hegarty, Alex Aiken, Pat Hanrahan, Jan Vitek:
Terra: a multi-stage language for high-performance computing. 105-116 - Jiajia Li, Guangming Tan, Mingyu Chen, Ninghui Sun:
SMAT: an input adaptive auto-tuner for sparse matrix-vector multiplication. 117-126 - Martin Kong, Richard Veras, Kevin Stock, Franz Franchetti, Louis-Noël Pouchet, P. Sadayappan:
When polyhedral transformations meet SIMD code generation. 127-138
Keynote address 2
- Fred B. Schneider:
Programming languages in security: keynote. 139-140
Dynamic analysis
- Jeff Huang, Charles Zhang, Julian Dolby:
CLAP: recording local executions to reproduce concurrency failures. 141-152 - Tayfun Elmas, Jacob Burnim, George C. Necula, Koushik Sen:
CONCURRIT: a domain specific language for reproducing concurrency bugs. 153-164 - Max Schäfer, Manu Sridharan, Julian Dolby, Frank Tip:
Dynamic determinacy analysis. 165-174
Compiler validation
- Jianzhou Zhao, Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic:
Formal verification of SSA-based optimizations for LLVM. 175-186 - Robin Morisset, Pankaj Pawan, Francesco Zappa Nardelli:
Compiler testing via a theory of sound optimisations in the C11/C++11 memory model. 187-196 - Yang Chen, Alex Groce, Chaoqiang Zhang, Weng-Keen Wong, Xiaoli Z. Fern, Eric Eide, John Regehr:
Taming compiler fuzzers. 197-208
Verification 1
- Sam Blackshear, Shuvendu K. Lahiri:
Almost-correct specifications: a modular semantic framework for assigning confidence to warnings. 209-218 - Byron Cook, Eric Koskinen:
Reasoning about nondeterminism in programs. 219-230 - Xiaokang Qiu, Pranav Garg, Andrei Stefanescu, Parthasarathy Madhusudan:
Natural proofs for structure, data, and separation. 231-242
Concurrency 1
- Hongtao Yu, Hou-Jen Ko, Zhiyuan Li:
General data structure expansion for multi-threading. 243-252 - Wei-Lun Hung, Vijay K. Garg:
AutoSynch: an automatic-signal monitor based on predicate tagging. 253-262 - Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran Yahav:
Concurrent libraries with foresight. 263-274
Symbolic execution
- Sam Blackshear, Bor-Yuh Evan Chang, Manu Sridharan:
Thresher: precise refutations for heap reachability. 275-286 - Abhishek Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin, Rajeev Alur:
TRANSIT: specifying protocols with concolic snippets. 287-296
Memory management
- Tiejun Gao, Karin Strauss, Stephen M. Blackburn, Kathryn S. McKinley, Doug Burger, James R. Larus:
Using managed runtime systems to tolerate holes in wearable memories. 297-308 - Nachshon Cohen, Erez Petrank:
Limitations of partial compaction: towards practical bounds. 309-320
Language design
- Ankush Desai, Vivek Gupta, Ethan K. Jackson, Shaz Qadeer, Sriram K. Rajamani, Damien Zufferey:
P: safe asynchronous event-driven programming. 321-332 - Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron:
Quipper: a scalable quantum programming language. 333-342 - Chinawat Isradisaikul, Andrew C. Myers:
Reconciling exhaustive pattern matching with objects. 343-354
Analysis
- Eric Bodden, Társis Tolêdo, Márcio Ribeiro, Claus Brabrand, Paulo Borba, Mira Mezini:
SPLLIFT: statically analyzing software product lines in minutes instead of years. 355-364 - Xin Zhang, Mayur Naik, Hongseok Yang:
Finding optimum abstractions in parametric dataflow analysis. 365-376 - Kalmer Apinis, Helmut Seidl, Vesal Vojdani:
How to combine widening and narrowing for non-monotonic systems of equations. 377-386
Monads and FRP
- Nikhil Swamy, Joel Weinberger, Cole Schlesinger, Juan Chen, Benjamin Livshits:
Verifying higher-order programs with the dijkstra monad. 387-398 - Ilya Sergey, Dominique Devriese, Matthew Might, Jan Midtgaard, David Darais, Dave Clarke, Frank Piessens:
Monadic abstract interpreters. 399-410 - Evan Czaplicki, Stephen Chong:
Asynchronous functional reactive programming for GUIs. 411-422
Alias analysis
- George Kastrinis, Yannis Smaragdakis:
Hybrid context-sensitivity for points-to analysis. 423-434 - Qirun Zhang, Michael R. Lyu, Hao Yuan, Zhendong Su:
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. 435-446 - Sriram Sankaranarayanan, Aleksandar Chakarov, Sumit Gulwani:
Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. 447-458
Verification 2
- Hongjin Liang, Xinyu Feng:
Modular verification of linearizability with non-fixed linearization points. 459-470 - Thomas Arthur Leck Sewell, Magnus O. Myreen, Gerwin Klein:
Translation validation for a verified OS kernel. 471-482 - Arjun Guha, Mark Reitblatt, Nate Foster:
Machine-verified network controllers. 483-494
Concurrency 2
- Tony Nowatzki, Michael Sartin-Tarm, Lorenzo De Carli, Karthikeyan Sankaralingam, Cristian Estan, Behnam Robatmili:
A general constraint-centric scheduling framework for spatial architectures. 495-506 - Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kalé:
Steal Tree: low-overhead tracing of work stealing schedulers. 507-518 - Jonathan Ragan-Kelley, Connelly Barnes, Andrew Adams, Sylvain Paris, Frédo Durand, Saman P. Amarasinghe:
Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines. 519-530
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 2026-03-15 21:54 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:
