Abstract is missing.
- Verifying that web pages have accessible layoutPavel Panchekha, Adam T. Geller, Michael D. Ernst, Zachary Tatlock, Shoaib Kamil. 1-14 [doi]
- BLeak: automatically debugging memory leaks in web applicationsJohn Vilk, Emery D. Berger. 15-29 [doi]
- Putting in all the stops: execution control for JavaScriptSamuel Baxter, Rachit Nigam, Joe Gibbs Politz, Shriram Krishnamurthi, Arjun Guha. 30-45 [doi]
- Persistency for synchronization-free regionsVaibhav Gogte, Stephan Diestelhorst, William Wang, Satish Narayanasamy, Peter M. Chen, Thomas F. Wenisch. 46-61 [doi]
- Write-rationing garbage collection for hybrid memoriesShoaib Akram, Jennifer B. Sartor, Kathryn S. McKinley, Lieven Eeckhout. 62-77 [doi]
- Mapping spiking neural networks onto a manycore neuromorphic architectureChit-Kwan Lin, Andreas Wild, Gautham N. Chinya, Tsung-Han Lin, Mike Davies, Hong Wang. 78-89 [doi]
- Static serializability analysis for causal consistencyLucas Brutschy, Dimitar Dimitrov, Peter Müller 0001, Martin T. Vechev. 90-104 [doi]
- CUBA: interprocedural Context-UnBounded Analysis of concurrent programsPeizun Liu, Thomas Wahl. 105-119 [doi]
- Symbolic reasoning for automatic signal placementKostas Ferles, Jacob Van Geffen, Isil Dillig, Yannis Smaragdakis. 120-134 [doi]
- Advanced automata-based algorithms for program termination checkingYu-Fang Chen, Matthias Heizmann, Ondrej Lengál, Yong Li, Ming-Hsien Tsai, Andrea Turrini, Lijun Zhang. 135-150 [doi]
- HHVM JIT: a profile-guided, region-based compiler for PHP and HackGuilherme Ottoni. 151-165 [doi]
- On-stack replacement, distilledDaniele Cono D'Elia, Camil Demetrescu. 166-180 [doi]
- EffectiveSan: type and memory error detection using dynamically typed C/C++Gregory J. Duck, Roland H. C. Yap. 181-195 [doi]
- Calling-to-reference context translation via constraint-guided CFL-reachabilityCheng Cai, Qirun Zhang, Zhiqiang Zuo, Khanh Nguyen, Guoqing Xu, Zhendong Su. 196-210 [doi]
- The semantics of transactions and weak memory in x86, Power, ARM, and C++Nathan Chong, Tyler Sorensen, John Wickerson. 211-225 [doi]
- MixT: a language for mixing consistency in geodistributed transactionsMatthew Milano, Andrew C. Myers. 226-241 [doi]
- Bounding data races in space and timeStephen Dolan, K. C. Sivaramakrishnan, Anil Madhavapeddy. 242-255 [doi]
- Finding root causes of floating point errorAlex Sanchez-Stern, Pavel Panchekha, Sorin Lerner, Zachary Tatlock. 256-269 [doi]
- Ryū: fast float-to-string conversionUlf Adams. 270-282 [doi]
- To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-triesMichael J. Steindorfer, Jurgen J. Vinju. 283-295 [doi]
- Spatial: a language and compiler for application acceleratorsDavid Koeplinger, Matthew Feldman, Raghu Prabhakar, Yaqi Zhang, Stefan Hadjis, Ruben Fiszel, Tian Zhao, Luigi Nardi, Ardavan Pedram, Christos Kozyrakis, Kunle Olukotun. 296-311 [doi]
- Enhancing computation-to-core assignment with physical location informationOrhan Kislal, Jagadish Kotra, Xulong Tang, Mahmut Taylan Kandemir, Myoungsoo Jung. 312-327 [doi]
- SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order coresKim-Anh Tran, Alexandra Jimborean, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, Stefanos Kaxiras. 328-343 [doi]
- iReplayer: in-situ and identical record-and-replay for multithreaded applicationsHongyu Liu, Sam Silvestro, Wei Wang, Chen Tian, Tongping Liu. 344-358 [doi]
- D4: fast concurrency debugging with parallel differential analysisBozhen Liu, Jeff Huang 0001. 359-373 [doi]
- High-coverage, unbounded sound predictive race detectionJake Roemer, Kaan Genç, Michael D. Bond. 374-389 [doi]
- CURD: a dynamic CUDA race detectorYuanfeng Peng, Vinod Grover, Joseph Devietti. 390-403 [doi]
- A general path-based representation for predicting program propertiesUri Alon 0002, Meital Zilberstein, Omer Levy, Eran Yahav. 404-419 [doi]
- Program synthesis using conflict-driven learningYu Feng, Ruben Martins, Osbert Bastani, Isil Dillig. 420-435 [doi]
- Accelerating search-based program synthesis using learned probabilistic modelsWoosuk Lee, Kihong Heo, Rajeev Alur, Mayur Naik. 436-449 [doi]
- Inferring crypto API rules from code changesRumen Paletov, Petar Tsankov, Veselin Raychev, Martin T. Vechev. 450-464 [doi]
- Automated clustering and program repair for introductory programming assignmentsSumit Gulwani, Ivan Radicek, Florian Zuleger. 465-480 [doi]
- Search, align, and repair: data-driven feedback generation for introductory programming exercisesKe Wang, Rishabh Singh, Zhendong Su. 481-495 [doi]
- Bounded expectations: resource analysis for probabilistic programsVan Chan Ngo, Quentin Carbonneaux, Jan Hoffmann 0002. 496-512 [doi]
- PMAF: an algebraic framework for static analysis of probabilistic programsDi Wang, Jan Hoffmann 0002, Thomas W. Reps. 513-528 [doi]
- Polyhedral auto-transformation with no integer linear programmingAravind Acharya, Uday Bondhugula, Albert Cohen 0001. 529-542 [doi]
- Partial control-flow linearizationSimon Moll, Sebastian Hack. 543-556 [doi]
- Locality analysis through static parallel samplingDong Chen, Fangzhou Liu, Chen Ding, Sreepathi Pai. 557-570 [doi]
- Incremental inference for probabilistic programsMarco Cusumano-Towner, Benjamin Bichsel, Timon Gehr, Martin T. Vechev, Vikash K. Mansinghka. 571-585 [doi]
- Bayonet: probabilistic inference for networksTimon Gehr, Sasa Misailovic, Petar Tsankov, Laurent Vanbever, Pascal Wiesmann, Martin T. Vechev. 586-602 [doi]
- Probabilistic programming with programmable inferenceVikash K. Mansinghka, Ulrich Schaechtle, Shivam Handa, Alexey Radul, Yutian Chen, Martin Rinard. 603-616 [doi]
- VeriPhy: verified controller executables from verified cyber-physical system modelsBrandon Bohrer, Yong Kiam Tan, Stefan Mitsch, Magnus O. Myreen, André Platzer. 617-630 [doi]
- Crellvm: verified credible compilation for LLVMJeehoon Kang, Yoonseung Kim, Youngju Song, Juneyoung Lee, Sanghoon Park, Mark Dongyeon Shin, Yonghyun Kim, Sungkeun Cho, Joonwon Choi, Chung-Kil Hur, Kwangkeun Yi. 631-645 [doi]
- Certified concurrent abstraction layersRonghui Gu, Zhong Shao, Jieung Kim, Xiongnan (Newman) Wu, Jérémie Koenig, Vilhelm Sjöberg, Hao Chen 0023, David Costanzo, Tahina Ramananandro. 646-661 [doi]
- Modularity for decidability of deductive verification with applications to distributed systemsMarcelo Taube, Giuliano Losa, Kenneth L. McMillan, Oded Padon, Mooly Sagiv, Sharon Shoham, James R. Wilcox, Doug Woos. 662-677 [doi]
- Active learning of points-to specificationsOsbert Bastani, Rahul Sharma 0001, Alex Aiken, Percy Liang. 678-692 [doi]
- Pinpoint: fast and precise sparse value flow analysis for million lines of codeQingkai Shi, Xiao Xiao, Rongxin Wu, Jinguo Zhou, Gang Fan, Charles Zhang. 693-706 [doi]
- A data-driven CHC solverHe Zhu, Stephen Magill, Suresh Jagannathan. 707-721 [doi]
- User-guided program reasoning using Bayesian inferenceMukund Raghothaman, Sulekha Kulkarni, Kihong Heo, Mayur Naik. 722-735 [doi]
- GPU code optimization using abstract kernel emulation and sensitivity analysisChangwan Hong, Aravind Sukumaran-Rajam, Jinsung Kim, Prashant Singh Rawat, Sriram Krishnamoorthy, Louis-Noël Pouchet, Fabrice Rastello, P. Sadayappan. 736-751 [doi]
- Gluon: a communication-optimizing substrate for distributed heterogeneous graph analyticsRoshan Dathathri, Gurbinder Gill, Loc Hoang, Hoang-Vu Dang, Alex Brooks, Nikoli Dryden, Marc Snir, Keshav Pingali. 752-768 [doi]
- Heartbeat scheduling: provable efficiency for nested parallelismUmut A. Acar, Arthur Charguéraud, Adrien Guatto, Mike Rainey, Filip Sieczkowski. 769-782 [doi]
- Guarded impredicative polymorphismAlejandro Serrano, Jurriaan Hage, Dimitrios Vytiniotis, Simon L. Peyton Jones. 783-796 [doi]
- Typed closure conversion for the calculus of constructionsWilliam J. Bowman, Amal Ahmed. 797-811 [doi]
- Inferring type rules for syntactic sugarJustin Pombrio, Shriram Krishnamurthi. 812-825 [doi]