Table of Contents

• Checking correctness of TypeScript interfaces for JavaScript librariesAsger Feldthaus, Anders Møller. 1-16 [doi]
• Determinacy in static analysis for jQueryEsben Andreasen, Anders Møller. 17-31 [doi]
• EventBreak: analyzing the responsiveness of user interfaces through performance-guided test generationMichael Pradel, Parker Schuh, George C. Necula, Koushik Sen. 33-47 [doi]
• Using web corpus statistics for program analysisChun-Hung Hsiao, Michael J. Cafarella, Satish Narayanasamy. 49-65 [doi]
• Tardis: affordable time-travel debugging in managed runtimesEarl T. Barr, Mark Marron. 67-82 [doi]
• Phosphor: illuminating dynamic data flow in commodity jvmsJonathan Bell, Gail E. Kaiser. 83-101 [doi]
• Rubah: DSU for Java on a stock JVMLuís Pina, Luís Veiga, Michael W. Hicks. 103-119 [doi]
• Fast conservative garbage collectionRifat Shahriyar, Stephen M. Blackburn, Kathryn S. McKinley. 121-139 [doi]
• Region-based memory management for GPU programming languages: enabling rich data structures on a spartan hostEric Holk, Ryan Newton, Jeremy G. Siek, Andrew Lumsdaine. 141-155 [doi]
• Smten with satisfiability-based searchRichard Uhler, Nirav Dave. 157-176 [doi]
• StreamJIT: a commensal compiler for high-performance stream programmingJeffrey Bosboom, Sumanaruban Rajadurai, Weng-Fai Wong, Saman P. Amarasinghe. 177-195 [doi]
• SurveyMan: programming and automatically debugging surveysEmma Tosch, Emery D. Berger. 197-211 [doi]
• Rate types for stream programsThomas Bartenstein, Yu David Liu. 213-232 [doi]
• Foundations of path-dependent types Nada Amin, Tiark Rompf, Martin Odersky. 233-249 [doi]
• Confined gradual typingEsteban Allende, Johan Fabry, Ronald Garcia, Éric Tanter. 251-270 [doi]
• Refactoring Java generics by inferring wildcards, in practiceJohn Altidor, Yannis Smaragdakis. 271-290 [doi]
• Continuously measuring critical section pressure with the free-lunch profilerFlorian David, Gael Thomas, Julia Lawall, Gilles Muller. 291-307 [doi]
• Chisel: reliability- and accuracy-aware optimization of approximate computational kernelsSasa Misailovic, Michael Carbin, Sara Achour, Zichao Qi, Martin C. Rinard. 309-328 [doi]
• An experimental survey of energy management across the stackMelanie Kambadur, Martha A. Kim. 329-344 [doi]
• Understanding energy behaviors of thread management constructsGustavo Pinto, Fernando Castor, Yu David Liu. 345-360 [doi]
• Distributed REScala: an update algorithm for distributed reactive programmingJoscha Drechsler, Guido Salvaneschi, Ragnar Mogk, Mira Mezini. 361-376 [doi]
• From object algebras to attribute grammarsTillmann Rendel, Jonathan Immanuel Brachthäuser, Klaus Ostermann. 377-395 [doi]
• Late data layout: unifying data representation transformationsVlad Ureche, Eugene Burmako, Martin Odersky. 397-416 [doi]
• i3QL: language-integrated live data viewsRalf Mitschke, Sebastian Erdweg, Mirko Köhler, Mira Mezini, Guido Salvaneschi. 417-432 [doi]
• Atlas: leveraging locks for non-volatile memory consistencyDhruva R. Chakrabarti, Hans-Juergen Boehm, Kumud Bhandari. 433-452 [doi]
• Fast splittable pseudorandom number generatorsGuy L. Steele Jr., Doug Lea, Christine H. Flood. 453-472 [doi]
• Multithreaded test synthesis for deadlock detectionMalavika Samak, Murali Krishna Ramanathan. 473-489 [doi]
• Symbolic execution of multithreaded programs from arbitrary program contextsTom Bergan, Dan Grossman, Luis Ceze. 491-506 [doi]
• CheckCell: data debugging for spreadsheetsDaniel W. Barowy, Dimitar Gochev, Emery D. Berger. 507-523 [doi]
• Finding minimum type error sourcesZvonimir Pavlinovic, Tim King, Thomas Wies. 525-542 [doi]
• Flint: fixing linearizability violationsPeng Liu, Omer Tripp, Xiangyu Zhang. 543-560 [doi]
• Statistical debugging for real-world performance problemsLinhai Song, Shan Lu. 561-578 [doi]
• Adaptive LL(*) parsing: the power of dynamic analysisTerence John Parr, Sam Harwell, Kathleen Fisher. 579-598 [doi]
• Automated migration of build scripts using dynamic analysis and search-based refactoringMilos Gligoric, Wolfram Schulte, Chandra Prasad, Danny van Velzen, Iman Narasamdya, Benjamin Livshits. 599-616 [doi]
• MIX10: compiling MATLAB to X10 for high performanceVineet Kumar, Laurie J. Hendren. 617-636 [doi]
• Staged parser combinators for efficient data processingManohar Jonnalagedda, Thierry Coppey, Sandro Stucki, Tiark Rompf, Martin Odersky. 637-653 [doi]
• Bounded exhaustive test input generation from hybrid invariantsNicolás Rosner, Valeria S. Bengolea, Pablo Ponzio, Shadi Abdul Khalek, Nazareno Aguirre, Marcelo F. Frias, Sarfraz Khurshid. 655-674 [doi]
• Compiler verification meets cross-language linking via data abstractionPeng Wang, Santiago Cuellar, Adam Chlipala. 675-690 [doi]
• GPS: navigating weak memory with ghosts, protocols, and separationAaron Turon, Viktor Vafeiadis, Derek Dreyer. 691-707 [doi]
• Natural proofs for asynchronous programs using almost-synchronous reductionsAnkush Desai, Pranav Garg 0001, P. Madhusudan. 709-725 [doi]
• Accelerating iterators in optimizing AST interpretersWei Zhang, Per Larsen, Stefan Brunthaler, Michael Franz. 727-743 [doi]
• Call sequence prediction through probabilistic calling automataZhijia Zhao, Bo Wu, Mingzhou Zhou, Yufei Ding, Jianhua Sun, Xipeng Shen, Youfeng Wu. 745-762 [doi]
• Space-efficient multi-versioning for input-adaptive feedback-driven program optimizationsMingzhou Zhou, Xipeng Shen, Yaoqing Gao, Graham Yiu. 763-776 [doi]
• The hiphop virtual machineKeith Adams, Jason Evans, Bertrand Maher, Guilherme Ottoni, Andrew Paroski, Brett Simmers, Edwin Smith, Owen Yamauchi. 777-790 [doi]
• Validation of memory accesses through symbolic analysesHenrique Nazaré, Izabela Maffra, Willer Santos, Leonardo Barbosa, Laure Gonnord, Fernando Magno Quintão Pereira. 791-809 [doi]
• Abstract semantic differencing via speculative correlationNimrod Partush, Eran Yahav. 811-828 [doi]
• Efficient subcubic alias analysis for CQirun Zhang, Xiao Xiao, Charles Zhang, Hao Yuan, Zhendong Su. 829-845 [doi]
• Static analysis for independent app developersLucas Brutschy, Pietro Ferrara, Peter Müller 0001. 847-860 [doi]
• ASPIRE: exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSMKeval Vora, Sai Charan Koduru, Rajiv Gupta. 861-878 [doi]
• Alembic: automatic locality extraction via migrationBrandon Holt, Preston Briggs, Luis Ceze, Mark Oskin. 879-894 [doi]
• Cybertron: pushing the limit on I/O reduction in data-parallel programsTian Xiao, Zhenyu Guo, Hucheng Zhou, Jiaxing Zhang, Xu Zhao, Chencheng Ye, Xi Wang, Wei Lin, Wenguang Chen, Lidong Zhou. 895-908 [doi]
• Translating imperative code to MapReduceCosmin Radoi, Stephen J. Fink, Rodric M. Rabbah, Manu Sridharan. 909-927 [doi]