Abstract is missing.
- Detecting redundant CSS rules in HTML5 applications: a tree rewriting approachMatthew Hague, Anthony Widjaja Lin, C.-H. Luke Ong. 1-19 [doi]
- SATCheck: SAT-directed stateless model checking for SC and TSOBrian Demsky, Patrick Lam. 20-36 [doi]
- Programming with enumerable sets of structuresIvan Kuraj, Viktor Kuncak, Daniel Jackson. 37-56 [doi]
- Stateless model checking of event-driven applicationsCasper Svenning Jensen, Anders Møller, Veselin Raychev, Dimitar Dimitrov, Martin T. Vechev. 57-73 [doi]
- Synthesis of layout engines from relational constraintsThibaud Hottelier, Rastislav Bodík. 74-88 [doi]
- A sound and optimal incremental build system with dynamic dependenciesSebastian Erdweg, Moritz Lichter, Manuel Weiel. 89-106 [doi]
- FlashMeta: a framework for inductive program synthesisOleksandr Polozov, Sumit Gulwani. 107-126 [doi]
- Scrap your boilerplate with object algebrasHaoyuan Zhang, Zewei Chu, Bruno C. D. S. Oliveira, Tijs van der Storm. 127-146 [doi]
- Conditionally correct superoptimizationRahul Sharma 0001, Eric Schkufza, Berkeley R. Churchill, Alex Aiken. 147-162 [doi]
- Selective control-flow abstraction via jumpingSam Blackshear, Bor-Yuh Evan Chang, Manu Sridharan. 163-182 [doi]
- Automating grammar comparisonRavichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, Viktor Kuncak. 183-200 [doi]
- Reasoning about the POSIX file system: local update and global pathnamesGian Ntzik, Philippa Gardner. 201-220 [doi]
- AutoMO: automatic inference of memory order parameters for C/C++11Peizhao Ou, Brian Demsky. 221-240 [doi]
- Valor: efficient, software-only region conflict exceptionsSwarnendu Biswas, Minjia Zhang, Michael D. Bond, Brandon Lucia. 241-259 [doi]
- Automatic memory reclamation for lock-free data structuresNachshon Cohen, Erez Petrank. 260-279 [doi]
- Protocol-based verification of message-passing parallel programsHugo A. López, Eduardo R. B. Marques, Francisco Martins, Nicholas Ng, César Santos, Vasco Thudichum Vasconcelos, Nobuko Yoshida. 280-298 [doi]
- Interactively verifying absence of explicit information flows in Android appsOsbert Bastani, Saswat Anand, Alex Aiken. 299-315 [doi]
- ShamDroid: gracefully degrading functionality in the presence of limited resource accessLucas Brutschy, Pietro Ferrara, Omer Tripp, Marco Pistoia. 316-331 [doi]
- Scalable race detection for Android applicationsPavol Bielik, Veselin Raychev, Martin T. Vechev. 332-348 [doi]
- Versatile yet lightweight record-and-replay for AndroidYongjian Hu, Tanzirul Azim, Iulian Neamtiu. 349-366 [doi]
- Declarative fence insertionJohn Bender, Mohsen Lesani, Jens Palsberg. 367-385 [doi]
- Finding deep compiler bugs via guided stochastic program mutationVu Le, Chengnian Sun, Zhendong Su. 386-399 [doi]
- Vectorization of apply to reduce interpretation overhead of RHaichuan Wang, David A. Padua, Peng Wu. 400-415 [doi]
- Synthesizing Java expressions from free-form queriesTihomir Gvero, Viktor Kuncak. 416-432 [doi]
- Accurate profiling in the presence of dynamic compilationYudi Zheng, Lubomír Bulej, Walter Binder. 433-450 [doi]
- Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structuresMartin Aigner 0003, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova. 451-469 [doi]
- Probability type inference for flexible approximate programmingBrett Boston, Adrian Sampson, Dan Grossman, Luis Ceze. 470-487 [doi]
- Cross-layer memory management for managed language applicationsMichael R. Jantz, Forrest J. Robinson, Prasad A. Kulkarni, Kshitij A. Doshi. 488-504 [doi]
- Static analysis of event-driven Node.js JavaScript applicationsMagnus Madsen, Frank Tip, Ondrej Lhoták. 505-519 [doi]
- EXPLORER : query- and demand-driven exploration of interprocedural control flow propertiesYu Feng, Xinyu Wang, Isil Dillig, Calvin Lin. 520-534 [doi]
- Giga-scale exhaustive points-to analysis for Java in under a minuteJens Dietrich, Nicholas Hollingum, Bernhard Scholz. 535-551 [doi]
- Galois transformers and modular abstract interpreters: reusable metatheory for program analysisDavid Darais, Matthew Might, David Van Horn. 552-571 [doi]
- Learning a strategy for adapting a program analysis via bayesian optimisationHakjoo Oh, Hongseok Yang, Kwangkeun Yi. 572-588 [doi]
- Runtime pointer disambiguationPéricles Alves, Fabian Gruber, Johannes Doerfert, Alexandros Lamprineas, Tobias Grosser, Fabrice Rastello, Fernando Magno Quintão Pereira. 589-606 [doi]
- Performance problems you can fix: a dynamic analysis of memoization opportunitiesLuca Della Toffola, Michael Pradel, Thomas R. Gross. 607-622 [doi]
- RAIVE: runtime assessment of floating-point instability by vectorizationWen-Chuan Lee, Tao Bao, Yunhui Zheng, Xiangyu Zhang, Keval Vora, Rajiv Gupta. 623-638 [doi]
- Automated backward error analysis for numerical codeZhoulai Fu, Zhaojun Bai, Zhendong Su. 639-654 [doi]
- Using C language extensions for developing embedded software: a case studyMarkus Völter, Arie van Deursen, Bernd Kolb, Stephan Eberle. 655-674 [doi]
- How scale affects structure in Java programsCristina V. Lopes, Joel Ossher. 675-694 [doi]
- Use at your own risk: the Java unsafe API in the wildLuis Mastrangelo, Luca Ponzanelli, Andrea Mocci, Michele Lanza, Matthias Hauswirth, Nathaniel Nystrom. 695-710 [doi]
- Approximate computation with outlier detection in TopazSara Achour, Martin C. Rinard. 711-730 [doi]
- Remote-scope promotion: clarified, rectified, and verifiedJohn Wickerson, Mark Batty, Bradford M. Beckmann, Alastair F. Donaldson. 731-747 [doi]
- Incremental computation with namesMatthew A. Hammer, Joshua Dunfield, Kyle Headley, Nicholas Labich, Jeffrey S. Foster, Michael W. Hicks, David Van Horn. 748-766 [doi]
- Checks and balances: constraint solving without surprises in object-constraint programming languagesTim Felgentreff, Todd D. Millstein, Alan Borning, Robert Hirschfeld. 767-782 [doi]
- Optimizing hash-array mapped tries for fast and lean immutable JVM collectionsMichael J. Steindorfer, Jurgen J. Vinju. 783-800 [doi]
- Automating ad hoc data representation transformationsVlad Ureche, Aggelos Biboudis, Yannis Smaragdakis, Martin Odersky. 801-820 [doi]
- Tracing vs. partial evaluation: comparing meta-compilation approaches for self-optimizing interpretersStefan Marr, Stéphane Ducasse. 821-839 [doi]
- Effectively mapping linguistic abstractions for message-passing concurrency to threads on the Java virtual machineGanesha Upadhyaya, Hridesh Rajan. 840-859 [doi]
- Partial evaluation of machine codeVenkatesh Srinivasan, Thomas W. Reps. 860-879 [doi]
- A co-contextual formulation of type rules and its application to incremental type checkingSebastian Erdweg, Oliver Bracevac, Edlira Kuci, Matthias Krebs, Mira Mezini. 880-897 [doi]
- Disjointness domains for fine-grained aliasingStephan Brandauer, Dave Clarke, Tobias Wrigstad. 898-916 [doi]
- The chemical approach to typestate-oriented programmingSilvia Crafa, Luca Padovani. 917-934 [doi]
- Customizable gradual polymorphic effects for ScalaMatías Toro, Éric Tanter. 935-953 [doi]