Abstract is missing.
- A compiler for throughput optimization of graph algorithms on GPUsSreepathi Pai, Keshav Pingali. 1-19 [doi]
- Automatic parallelization of pure method calls via conditional future synthesisRishi Surendran, Vivek Sarkar. 20-38 [doi]
- Portable inter-workgroup barrier synchronisation for GPUsTyler Sorensen, Alastair F. Donaldson, Mark Batty, Ganesh Gopalakrishnan, Zvonimir Rakamaric. 39-58 [doi]
- Parallel incremental whole-program optimizations for Scala.jsSébastien Doeraene, Tobias Schlatter. 59-73 [doi]
- Semantics-based program verifiers for all languagesAndrei Stefanescu, Daejun Park, Shijiao Yuwen, Yilong Li, Grigore Rosu. 74-91 [doi]
- Hoare-style specifications as correctness conditions for non-linearizable concurrent objectsIlya Sergey, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco. 92-110 [doi]
- An operational semantics for C/C++11 concurrencyKyndylan Nienhuis, Kayvan Memarian, Peter Sewell. 111-128 [doi]
- Modeling and analysis of remote memory access programmingAndrei Marian Dan, Patrick Lam, Torsten Hoefler, Martin T. Vechev. 129-144 [doi]
- Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformationsShachar Itzhaky, Rohit Singh 0002, Armando Solar-Lezama, Kuat Yessenov, Yongquan Lu, Charles E. Leiserson, Rezaul Alam Chowdhury. 145-164 [doi]
- Speeding up machine-code synthesisVenkatesh Srinivasan, Tushar Sharma, Thomas W. Reps. 165-180 [doi]
- Automated reasoning for web page layoutPavel Panchekha, Emina Torlak. 181-194 [doi]
- FIDEX: filtering spreadsheet data using examplesXinyu Wang, Sumit Gulwani, Rishabh Singh. 195-213 [doi]
- Extensible access control with authorization contractsScott Moore, Christos Dimoulas, Robby Findler, Matthew Flatt, Stephen Chong. 214-233 [doi]
- Gentrification gone too far? affordable 2nd-class values for fun and (co-)effectLeo Osvald, Grégory Essertel, Xilun Wu, Lilliam I. González Alayón, Tiark Rompf. 234-251 [doi]
- Incremental forest: a DSL for efficiently managing filestoresJonathan DiLorenzo, Richard Zhang, Erin Menzies, Kathleen Fisher, Nate Foster. 252-271 [doi]
- LaCasa: lightweight affinity and object capabilities in ScalaPhilipp Haller, Alexander Loiko. 272-291 [doi]
- Purposes, concepts, misfits, and a redesign of gitSantiago Perez De Rosso, Daniel Jackson. 292-310 [doi]
- Apex: automatic programming assignment error explanationDohyeong Kim, Yonghwi Kwon, Peng Liu 0010, I. Luk Kim, David Mitchel Perry, Xiangyu Zhang, Gustavo Rodriguez-Rivera. 311-327 [doi]
- Asserting reliable convergence for configuration management scriptsOliver Hanappi, Waldemar Hummer, Schahram Dustdar. 328-343 [doi]
- Dependent partitioningSean Treichler, Michael Bauer, Rahul Sharma 0001, Elliott Slaughter, Alex Aiken. 344-358 [doi]
- Accelerating program analyses by cross-program trainingSulekha Kulkarni, Ravi Mangal, Xin Zhang, Mayur Naik. 359-377 [doi]
- An improved algorithm for slicing machine codeVenkatesh Srinivasan, Thomas W. Reps. 378-393 [doi]
- Call graphs for languages with parametric polymorphismDmitry Petrashko, Vlad Ureche, Ondrej Lhoták, Martin Odersky. 394-409 [doi]
- Type inference for static compilation of JavaScriptSatish Chandra 0001, Colin S. Gordon, Jean-Baptiste Jeannin, Cole Schlesinger, Manu Sridharan, Frank Tip, Young-Il Choi. 410-429 [doi]
- Directed synthesis of failing concurrent executionsMalavika Samak, Omer Tripp, Murali Krishna Ramanathan. 430-446 [doi]
- Maximal causality reduction for TSO and PSOShiyou Huang, Jeff Huang 0001. 447-461 [doi]
- Precise and maximal race detection from incomplete tracesJeff Huang 0001, Arun K. Rajagopalan. 462-476 [doi]
- Stateless model checking with data-race preemption pointsBen Blum, Garth A. Gibson. 477-493 [doi]
- Automatic enforcement of expressive security policies using enclavesAnitha Gollamudi, Stephen Chong. 494-513 [doi]
- Chain: tasks and channels for reliable intermittent programsAlexei Colin, Brandon Lucia. 514-530 [doi]
- GEMs: shared-memory parallel programming for Node.jsDaniele Bonetta, Luca Salucci, Stefan Marr, Walter Binder. 531-547 [doi]
- OrcO: a concurrency-first approach to objectsArthur Michener Peters, David Kitchin, John A. Thywissen, William R. Cook. 548-567 [doi]
- Semantic subtyping for imperative object-oriented languagesDavide Ancona, Andrea Corradi. 568-587 [doi]
- Parsing with first-class derivativesJonathan Immanuel Brachthäuser, Tillmann Rendel, Klaus Ostermann. 588-606 [doi]
- The missing link: explaining ELF static linking, semanticallyStephen Kell, Dominic P. Mulligan, Peter Sewell. 607-623 [doi]
- Type soundness for dependent object types (DOT)Tiark Rompf, Nada Amin. 624-641 [doi]
- Efficient and thread-safe objects for dynamically-typed languagesBenoit Daloze, Stefan Marr, Daniele Bonetta, Hanspeter Mössenböck. 642-659 [doi]
- Hybrid STM/HTM for nested transactions on OpenJDKKeith Chapman, Antony L. Hosking, J. Eliot B. Moss. 660-676 [doi]
- Makalu: fast recoverable allocation of non-volatile memoryKumud Bhandari, Dhruva R. Chakrabarti, Hans-Juergen Boehm. 677-694 [doi]
- Prioritized garbage collection: explicit GC support for software cachesDiogenes Nunez, Samuel Z. Guyer, Emery D. Berger. 695-710 [doi]
- Computing repair alternatives for malformed programs using constraint attribute grammarsFriedrich Steimann, Jörg Hagemann, Bastian Ulke. 711-730 [doi]
- Probabilistic model for code with decision treesVeselin Raychev, Pavol Bielik, Martin T. Vechev. 731-747 [doi]
- Ringer: web automation by demonstrationShaon Barman, Sarah Chasins, Rastislav Bodík, Sumit Gulwani. 748-764 [doi]
- Scalable verification of border gateway protocol configurations with an SMT solverKonstantin Weitz, Doug Woos, Emina Torlak, Michael D. Ernst, Arvind Krishnamurthy, Zachary Tatlock. 765-780 [doi]
- A practical framework for type inference error explanationCalvin Loncaric, Satish Chandra 0001, Cole Schlesinger, Manu Sridharan. 781-799 [doi]
- Dynamically diagnosing type errors in unsafe codeStephen Kell. 800-819 [doi]
- First-class effect reflection for effect-guided programmingYuheng Long , Yu David Liu, Hridesh Rajan. 820-837 [doi]
- Java and scala's type systems are unsound: the existential crisis of null pointers Nada Amin, Ross Tate. 838-848 [doi]
- Finding compiler bugs via live code mutationChengnian Sun, Vu Le, Zhendong Su. 849-863 [doi]
- Finding resume and restart errors in Android applicationsZhiyong Shan, Tanzirul Azim, Iulian Neamtiu. 864-880 [doi]
- Low-overhead and fully automated statistical debugging with abstraction refinementZhiqiang Zuo, Lu Fang, Siau-Cheng Khoo, Guoqing (Harry) Xu, Shan Lu. 881-896 [doi]
- To be precise: regression aware debuggingRohan Bavishi, Awanish Pandey, Subhajit Roy. 897-915 [doi]