Abstract is missing.
- Look up!: your future is in the cloudJames R. Larus. 1-2 [doi]
- Optimizing database-backed applications with query synthesisAlvin Cheung, Armando Solar-Lezama, Samuel Madden. 3-14 [doi]
- Automated feedback generation for introductory programming assignmentsRishabh Singh, Sumit Gulwani, Armando Solar-Lezama. 15-26 [doi]
- Complete completion using types and weightsTihomir Gvero, Viktor Kuncak, Ivan Kuraj, Ruzica Piskac. 27-38 [doi]
- Fast condensation of the program dependence graphNick P. Johnson, Taewook Oh, Ayal Zaks, David I. August. 39-50 [doi]
- Scalable variable and data type detection in a binary rewriterKhaled Elwazeer, Kapil Anand, Aparna Kotha, Matthew Smithson, Rajeev Barua. 51-60 [doi]
- Fast RMWs for TSO: semantics and implementationBharghava Rajaram, Vijay Nagarajan, Susmit Sarkar, Marco Elver. 61-72 [doi]
- Rely-guarantee references for refinement types over aliased mutable dataColin S. Gordon, Michael D. Ernst, Dan Grossman. 73-84 [doi]
- Harmonizing classes, functions, tuples, and type parameters in virgil iiiBen Titzer. 85-94 [doi]
- It's alive! continuous feedback in UI programmingSebastian Burckhardt, Manuel Fähndrich, Peli de Halleux, Sean McDirmid, Michal Moskal, Nikolai Tillmann, Jun Kato. 95-104 [doi]
- Terra: a multi-stage language for high-performance computingZachary Devito, James Hegarty, Alex Aiken, Pat Hanrahan, Jan Vitek. 105-116 [doi]
- SMAT: an input adaptive auto-tuner for sparse matrix-vector multiplicationJiajia Li, Guangming Tan, Mingyu Chen, Ninghui Sun. 117-126 [doi]
- When polyhedral transformations meet SIMD code generationMartin Kong, Richard Veras, Kevin Stock, Franz Franchetti, Louis-Noël Pouchet, P. Sadayappan. 127-138 [doi]
- Programming languages in security: keynoteFred B. Schneider. 139-140 [doi]
- CLAP: recording local executions to reproduce concurrency failuresJeff Huang, Charles Zhang, Julian Dolby. 141-152 [doi]
- CONCURRIT: a domain specific language for reproducing concurrency bugsTayfun Elmas, Jacob Burnim, George C. Necula, Koushik Sen. 153-164 [doi]
- Dynamic determinacy analysisMax Schäfer, Manu Sridharan, Julian Dolby, Frank Tip. 165-174 [doi]
- Formal verification of SSA-based optimizations for LLVMJianzhou Zhao, Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic. 175-186 [doi]
- Compiler testing via a theory of sound optimisations in the C11/C++11 memory modelRobin Morisset, Pankaj Pawan, Francesco Zappa Nardelli. 187-196 [doi]
- Taming compiler fuzzersYang Chen, Alex Groce, Chaoqiang Zhang, Weng-Keen Wong, Xiaoli Fern, Eric Eide, John Regehr. 197-208 [doi]
- Almost-correct specifications: a modular semantic framework for assigning confidence to warningsSam Blackshear, Shuvendu K. Lahiri. 209-218 [doi]
- Reasoning about nondeterminism in programsByron Cook, Eric Koskinen. 219-230 [doi]
- Natural proofs for structure, data, and separationXiaokang Qiu, Pranav Garg 0001, Andrei Stefanescu, Parthasarathy Madhusudan. 231-242 [doi]
- General data structure expansion for multi-threadingHongtao Yu, Hou-Jen Ko, Zhiyuan Li. 243-252 [doi]
- AutoSynch: an automatic-signal monitor based on predicate taggingWei-Lun Hung, Vijay K. Garg. 253-262 [doi]
- Concurrent libraries with foresightGuy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran Yahav. 263-274 [doi]
- Thresher: precise refutations for heap reachabilitySam Blackshear, Bor-Yuh Evan Chang, Manu Sridharan. 275-286 [doi]
- TRANSIT: specifying protocols with concolic snippetsAbhishek Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin, Rajeev Alur. 287-296 [doi]
- Using managed runtime systems to tolerate holes in wearable memoriesTiejun Gao, Karin Strauss, Stephen M. Blackburn, Kathryn S. McKinley, Doug Burger, James R. Larus. 297-308 [doi]
- Limitations of partial compaction: towards practical boundsNachshon Cohen, Erez Petrank. 309-320 [doi]
- P: safe asynchronous event-driven programmingAnkush Desai, Vivek Gupta, Ethan K. Jackson, Shaz Qadeer, Sriram K. Rajamani, Damien Zufferey. 321-332 [doi]
- Quipper: a scalable quantum programming languageAlexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron. 333-342 [doi]
- Reconciling exhaustive pattern matching with objectsChinawat Isradisaikul, Andrew C. Myers. 343-354 [doi]
- LIFT: statically analyzing software product lines in minutes instead of yearsEric Bodden, Társis Tolêdo, Márcio Ribeiro, Claus Brabrand, Paulo Borba, Mira Mezini. 355-364 [doi]
- Finding optimum abstractions in parametric dataflow analysisXin Zhang, Mayur Naik, Hongseok Yang. 365-376 [doi]
- How to combine widening and narrowing for non-monotonic systems of equationsKalmer Apinis, Helmut Seidl, Vesal Vojdani. 377-386 [doi]
- Verifying higher-order programs with the dijkstra monadNikhil Swamy, Joel Weinberger, Cole Schlesinger, Juan Chen, Benjamin Livshits. 387-398 [doi]
- Monadic abstract interpretersIlya Sergey, Dominique Devriese, Matthew Might, Jan Midtgaard, David Darais, Dave Clarke, Frank Piessens. 399-410 [doi]
- Asynchronous functional reactive programming for GUIsEvan Czaplicki, Stephen Chong. 411-422 [doi]
- Hybrid context-sensitivity for points-to analysisGeorge Kastrinis, Yannis Smaragdakis. 423-434 [doi]
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysisQirun Zhang, Michael R. Lyu, Hao Yuan, Zhendong Su. 435-446 [doi]
- Static analysis for probabilistic programs: inferring whole program properties from finitely many pathsSriram Sankaranarayanan, Aleksandar Chakarov, Sumit Gulwani. 447-458 [doi]
- Modular verification of linearizability with non-fixed linearization pointsHongjin Liang, Xinyu Feng. 459-470 [doi]
- Translation validation for a verified OS kernelThomas Arthur Leck Sewell, Magnus O. Myreen, Gerwin Klein. 471-482 [doi]
- Machine-verified network controllersArjun Guha, Mark Reitblatt, Nate Foster. 483-494 [doi]
- A general constraint-centric scheduling framework for spatial architecturesTony Nowatzki, Michael Sartin-Tarm, Lorenzo De Carli, Karthikeyan Sankaralingam, Cristian Estan, Behnam Robatmili. 495-506 [doi]
- Steal Tree: low-overhead tracing of work stealing schedulersJonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kalé. 507-518 [doi]
- Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelinesJonathan Ragan-Kelley, Connelly Barnes, Andrew Adams, Sylvain Paris, Frédo Durand, Saman P. Amarasinghe. 519-530 [doi]