Abstract is missing.
- Automatically improving accuracy for floating point expressionsPavel Panchekha, Alex Sanchez-Stern, James R. Wilcox, Zachary Tatlock. 1-11 [doi]
- Diagnosing type errors with classDanfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis, Simon L. Peyton Jones. 12-21 [doi]
- Provably correct peephole optimizations with aliveNuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr. 22-32 [doi]
- Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stackMaarten Faddegon, Olaf Chitil. 33-42 [doi]
- Automatic error elimination by horizontal code transfer across multiple applicationsStelios Sidiroglou-Douskos, Eric Lahtinen, Fan Long, Martin Rinard. 43-54 [doi]
- Light: replay via tightly bounded recordingPeng Liu 0010, Xiangyu Zhang, Omer Tripp, Yunhui Zheng. 55-64 [doi]
- Many-core compiler fuzzingChristopher Lidbury, Andrei Lascu, Nathan Chong, Alastair F. Donaldson. 65-76 [doi]
- Mechanized verification of fine-grained concurrent programsIlya Sergey, Aleksandar Nanevski, Anindya Banerjee. 77-87 [doi]
- Verification of producer-consumer synchronization in GPU programsRahul Sharma 0001, Michael Bauer, Alex Aiken. 88-98 [doi]
- Relaxing safely: verified on-the-fly garbage collection for x86-TSOPeter Gammie, Antony L. Hosking, Kai Engelhardt. 99-109 [doi]
- Verifying read-copy-update in a logic for weak memoryJoseph Tassarotti, Derek Dreyer, Viktor Vafeiadis. 110-120 [doi]
- LaminarIR: compile-time queues for structured streamsYousun Ko, Bernd Burgstaller, Bernhard Scholz. 121-130 [doi]
- Optimizing off-chip accesses in multicoresWei Ding, Xulong Tang, Mahmut T. Kandemir, Yuanrui Zhang, Emre Kultursay. 131-142 [doi]
- Improving compiler scalability: optimizing large programs at small priceSanyam Mehta, Pen-Chung Yew. 143-152 [doi]
- Verification of a cryptographic primitive: SHA-256 (abstract)Andrew W. Appel. 153 [doi]
- Asynchronous programming, analysis and testing with state machinesPantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema, Akash Lal, Paul Thomson. 154-164 [doi]
- Stateless model checking concurrent programs with maximal causality reductionJeff Huang. 165-174 [doi]
- Synthesizing racy testsMalavika Samak, Murali Krishna Ramanathan, Suresh Jagannathan. 175-185 [doi]
- The Push/Pull model of transactionsEric Koskinen, Matthew J. Parkinson. 186-195 [doi]
- Efficient synthesis of network updatesJedidiah McClurg, Hossein Hojjat, Pavol Cerný, Nate Foster. 196-207 [doi]
- Efficient synthesis of probabilistic programsAditya V. Nori, Sherjil Ozair, Sriram K. Rajamani, Deepak Vijaykeerthy. 208-217 [doi]
- FlashRelate: extracting relational data from semi-structured spreadsheets using examplesDaniel W. Barowy, Sumit Gulwani, Ted Hart, Benjamin G. Zorn. 218-228 [doi]
- Synthesizing data structure transformations from input-output examplesJohn K. Feser, Swarat Chaudhuri, Isil Dillig. 229-239 [doi]
- Composing concurrency controlOfri Ziv, Alex Aiken, Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv. 240-249 [doi]
- Dynamic partial order reduction for relaxed memory modelsNaling Zhang, Markus Kusano, Chao Wang. 250-259 [doi]
- Monitoring refinement via symbolic reasoningMichael Emmi, Constantin Enea, Jad Hamza. 260-269 [doi]
- Preventing glitches and short circuits in high-level self-timed chip specificationsStephen Longfield Jr., Brittany Nkounkou, Rajit Manohar, Ross Tate. 270-279 [doi]
- DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programsAkash Lal, Shaz Qadeer. 280-290 [doi]
- Exploring and enforcing security guarantees via program dependence graphsAndrew Johnson, Lucas Waye, Scott Moore, Stephen Chong. 291-302 [doi]
- Making numerical program analysis fastGagandeep Singh, Markus Püschel, Martin T. Vechev. 303-313 [doi]
- Tree dependence analysisYusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu, Milind Kulkarni. 314-325 [doi]
- A formal C memory model supporting integer-pointer castsJeehoon Kang, Chung-Kil Hur, William Mansky, Dmitri Garbuzov, Steve Zdancewic, Viktor Vafeiadis. 326-335 [doi]
- Defining the undefinedness of CChris Hathhorn, Chucky Ellison, Grigore Rosu. 336-345 [doi]
- KJS: a complete formal semantics of JavaScriptDaejun Park, Andrei Stefanescu, Grigore Rosu. 346-356 [doi]
- Verdi: a framework for implementing and formally verifying distributed systemsJames R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock, Xi Wang, Michael D. Ernst, Thomas E. Anderson. 357-368 [doi]
- Static detection of asymptotic performance bugs in collection traversalsOswaldo Olivo, Isil Dillig, Calvin Lin. 369-378 [doi]
- Autotuning algorithmic choice for input sensitivityYufei Ding, Jason Ansel, Kalyan Veeramachaneni, Xipeng Shen, Una-May O'Reilly, Saman P. Amarasinghe. 379-390 [doi]
- Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL codeCharith Mendis, Jeffrey Bosboom, Kevin Wu, Shoaib Kamil, Jonathan Ragan-Kelley, Sylvain Paris, Qin Zhao, Saman P. Amarasinghe. 391-402 [doi]
- Profile-guided meta-programmingWilliam J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig. 403-412 [doi]
- Declarative programming over eventually consistent data storesK. C. Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan. 413-424 [doi]
- Blame and coercion: together again for the first timeJeremy G. Siek, Peter Thiemann, Philip Wadler. 425-435 [doi]
- Lightweight, flexible object-oriented genericsYizhou Zhang, Matthew C. Loring, Guido Salvaneschi, Barbara Liskov, Andrew C. Myers. 436-445 [doi]
- Relatively complete counterexamples for higher-order programsPhuc C. Nguyen, David Van Horn. 446-456 [doi]
- Automatic induction proofs of data-structures in imperative programsDuc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh. 457-466 [doi]
- Compositional certified resource boundsQuentin Carbonneaux, Jan Hoffmann 0002, Zhong Shao. 467-478 [doi]
- Peer-to-peer affine commitment using bitcoinKarl Crary, Michael J. Sullivan. 479-488 [doi]
- Termination and non-termination specification inferenceTon Chanh Le, Shengchao Qin, Wei-Ngan Chin. 489-498 [doi]
- Celebrating diversity: a mixture of experts approach for runtime mapping in dynamic environmentsMurali Krishna Emani, Michael F. P. O'Boyle. 499-508 [doi]
- Efficient execution of recursive programs on commodity vector hardwareBin Ren, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni. 509-520 [doi]
- Loop and data transformations for sparse matrix codeAnand Venkat, Mary W. Hall, Michelle Strout. 521-532 [doi]
- Synthesizing parallel graph programs via automated planningDimitrios Prountzos, Roman Manevich, Keshav Pingali. 533-544 [doi]
- Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromisesStefan Marr, Chris Seaton, Stéphane Ducasse. 545-554 [doi]
- Finding counterexamples from parsing conflictsChinawat Isradisaikul, Andrew C. Myers. 555-564 [doi]
- Interactive parser synthesis by exampleAlan Leung, John Sarracino, Sorin Lerner. 565-574 [doi]
- A simpler, safer programming and execution model for intermittent systemsBrandon Lucia, Benjamin Ransford. 575-585 [doi]
- Concurrency debugging with differential schedule projectionsNuno Machado, Brandon Lucia, Luís E. T. Rodrigues. 586-595 [doi]
- Synthesis of machine code from semanticsVenkatesh Srinivasan, Thomas W. Reps. 596-607 [doi]
- Synthesis of ranking functions using extremal counterexamplesLaure Gonnord, David Monniaux, Gabriel Radanne. 608-618 [doi]
- Type-and-example-directed program synthesisPeter-Michael Osera, Steve Zdancewic. 619-630 [doi]