Table of Contents

• Type-based safe resource deallocation for shared-memory concurrencyKohei Suenaga, Ryota Fukuda, Atsushi Igarashi. 1-20 [doi]
• Uniqueness and reference immutability for safe parallelismColin S. Gordon, Matthew J. Parkinson, Jared Parsons, Aleks Bromfield, Joe Duffy. 21-40 [doi]
• Safe compiler-driven transaction checkpointing and recoveryJaswanth Sreeram, Santosh Pande. 41-56 [doi]
• Towards a practical secure concurrent languageStefan Muller, Stephen Chong. 57-74 [doi]
• Predicate abstraction of Java programs with collectionsPavel Parizek, Ondrej Lhoták. 75-94 [doi]
• Reducing the barriers to writing verified specificationsTodd W. Schiller, Michael D. Ernst. 95-112 [doi]
• GPUVerify: a verifier for GPU kernelsAdam Betts, Nathan Chong, Alastair F. Donaldson, Shaz Qadeer, Paul Thomson. 113-132 [doi]
• Modular and verified automatic program repairFrancesco Logozzo, Thomas Ball. 133-146 [doi]
• Mitigating the compiler optimization phase-ordering problem using machine learningSameer Kulkarni, John Cavazos. 147-162 [doi]
• Optimization coaching: optimizers learn to communicate with programmersVincent St-Amour, Sam Tobin-Hochstadt, Matthias Felleisen. 163-178 [doi]
• Adaptive multi-level compilation in a trace-based Java JIT compilerHiroshi Inoue, Hiroshige Hayashizaki, Peng Wu, Toshio Nakatani. 179-194 [doi]
• On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languagesJosé G. Castanos, David Edelsohn, Kazuaki Ishizaki, Priya Nagpurkar, Toshio Nakatani, Takeshi Ogasawara, Peng Wu. 195-212 [doi]
• An abstract interpretation framework for refactoring with application to extract methods with contractsPatrick Cousot, Radhia Cousot, Francesco Logozzo, Michael Barnett. 213-232 [doi]
• Refactoring android Java code for on-demand computation offloadingYing Zhang, Gang Huang 0001, Xuanzhe Liu, Wei Zhang 0004, Hong Mei, Shunxiang Yang. 233-248 [doi]
• Kitsune: efficient, general-purpose dynamic software updating for CChristopher M. Hayden, Edward K. Smith, Michail Denchev, Michael Hicks, Jeffrey S. Foster. 249-264 [doi]
• Automating object transformations for dynamic software updatingStephen Magill, Michael Hicks, Suriya Subramanian, Kathryn S. McKinley. 265-280 [doi]
• Exploring multi-threaded Java application performance on multicore hardwareJennifer B. Sartor, Lieven Eeckhout. 281-296 [doi]
• Work-stealing without the baggageVivek Kumar, Daniel Frampton, Stephen M. Blackburn, David Grove, Olivier Tardieu. 297-314 [doi]
• Molecule: using monadic and streaming I/O to compose process networks on the JVMSébastien Bocq, Koen Daenen. 315-334 [doi]
• A black-box approach to understanding concurrency in DaCapoTomas Kalibera, Matthew Mole, Richard E. Jones, Jan Vitek. 335-354 [doi]
• Automatically enhancing locality for tree traversals with traversal splicingYoungjoon Jo, Milind Kulkarni. 355-374 [doi]
• Elixir: a system for synthesizing concurrent graph programsDimitrios Prountzos, Roman Manevich, Keshav Pingali. 375-394 [doi]
• From clarity to efficiency for distributed algorithmsYanhong A. Liu, Scott D. Stoller, Bo Lin, Michael Gorbovitski. 395-410 [doi]
• Program extrapolation with jennisysK. Rustan M. Leino, Aleksandar Milicevic. 411-430 [doi]
• Bolt: on-demand infinite loop escape in unmodified binariesMichael Kling, Sasa Misailovic, Michael Carbin, Martin C. Rinard. 431-450 [doi]
• LEAN: simplifying concurrency bug reproduction via replay-supported execution reductionJeff Huang, Charles Zhang. 451-466 [doi]
• IFRit: interference-free regions for dynamic data-race detectionLaura Effinger-Dean, Brandon Lucia, Luis Ceze, Dan Grossman, Hans-Juergen Boehm. 467-484 [doi]
• Maple: a coverage-driven testing tool for multithreaded programsJie Yu, Satish Narayanasamy, Cristiano Pereira, Gilles Pokam. 485-502 [doi]
• Taming MATLABAnton Willy Dubrau, Laurie J. Hendren. 503-522 [doi]
• Scaling symbolic execution using ranged analysisJunaid Haroon Siddiqui, Sarfraz Khurshid. 523-536 [doi]
• Higher-order symbolic execution via contractsSam Tobin-Hochstadt, David Van Horn. 537-554 [doi]
• Checking reachability using matching logicGrigore Rosu, Andrei Stefanescu. 555-574 [doi]
• The HipHop compiler for PHPHaiping Zhao, Iain Proctor, Minghui Yang, Xin Qi, Mark Williams, Qi Gao, Guilherme Ottoni, Andrew Paroski, Scott MacVicar, Jason Evans, Stephen Tu. 575-586 [doi]
• Dependent types for JavaScriptRavi Chugh, David Herman, Ranjit Jhala. 587-606 [doi]
• Eval begone!: semi-automated removal of eval from javascript programsFadi Meawad, Gregor Richards, Floréal Morandat, Jan Vitek. 607-620 [doi]
• Formal specification of a JavaScript module systemSeonghoon Kang, Sukyoung Ryu. 621-638 [doi]
• AutoMan: a platform for integrating human-based and digital computationDaniel W. Barowy, Charlie Curtsinger, Emery D. Berger, Andrew McGregor. 639-654 [doi]
• Talk versus work: characteristics of developer collaboration on the jazz platformSubhajit Datta, Renuka Sindhgatta, Bikram Sengupta. 655-668 [doi]
• Speculative analysis of integrated development environment recommendationsKivanç Muslu, Yuriy Brun, Reid Holmes, Michael D. Ernst, David Notkin. 669-682 [doi]
• An empirical study of the influence of static type systems on the usability of undocumented softwareClemens Mayer, Stefan Hanenberg, Romain Robbes, Éric Tanter, Andreas Stefik. 683-702 [doi]
• Software data-triggered threadsHung-Wei Tseng, Dean M. Tullsen. 703-716 [doi]
• Efficiently combining parallel software using fine-grained, language-level, hierarchical resource management policiesZachary R. Anderson. 717-736 [doi]
• Execution privatization for scheduler-oblivious concurrent programsJeff Huang, Charles Zhang. 737-752 [doi]
• Integrating task parallelism with actorsShams Mahmood Imam, Vivek Sarkar. 753-772 [doi]
• A variability-aware module systemChristian Kästner, Klaus Ostermann, Sebastian Erdweg. 773-792 [doi]
• Gradual typing for first-class classesAsumu Takikawa, T. Stephen Strickland, Christos Dimoulas, Sam Tobin-Hochstadt, Matthias Felleisen. 793-810 [doi]
• Constrained kindsOlivier Tardieu, Nathaniel Nystrom, Igor Peshansky, Vijay A. Saraswat. 811-830 [doi]
• Energy typesMichael Cohen, Haitao Steve Zhu, Emgin Ezgi Senem, Yu David Liu. 831-850 [doi]
• Exploiting inter-sequence correlations for program behavior predictionBo Wu, Zhijia Zhao, Xipeng Shen, Yunlian Jiang, Yaoqing Gao, Raúl Silvera. 851-866 [doi]
• k-Calling context profilingGiorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani. 867-878 [doi]
• Reim & ReImInfer: checking and inference of reference immutability and method purityWei Huang, Ana Milanova, Werner Dietl, Michael D. Ernst. 879-896 [doi]
• White box sampling in uncertain data processing enabled by program analysisTao Bao, Yunhui Zheng, Xiangyu Zhang. 897-914 [doi]
• Detecting problematic message sequences and frequencies in distributed systemsCharles Lucas, Sebastian G. Elbaum, David S. Rosenblum. 915-926 [doi]
• Reusing debugging knowledge via trace-based bug searchZhongxian Gu, Earl T. Barr, Drew Schleck, Zhendong Su. 927-942 [doi]
• Chaperones and impersonators: run-time support for reasonable interpositionT. Stephen Strickland, Sam Tobin-Hochstadt, Robby Findler, Matthew Flatt. 943-962 [doi]
• Open and efficient type switch for C++Yuriy Solodkyy, Gabriel Dos Reis, Bjarne Stroustrup. 963-982 [doi]
• Understanding the behavior of database operations under program controlJuan M. Tamayo, Alex Aiken, Nathan Grasso Bronson, Mooly Sagiv. 983-996 [doi]
• Typestate-based semantic code search over partial programsAlon Mishne, Sharon Shoham, Eran Yahav. 997-1016 [doi]
• Finding reusable data structuresGuoqing (Harry) Xu. 1017-1034 [doi]