Venues / PLDI /

PLDI 2013

48 papers

A general constraint-centric scheduling framework for spatial architectures · Tony Nowatzki, Michael Sartin-Tarm, Lorenzo De Carli, Karthikeyan Sankaralingam, Cristian Estan, Behnam Robatmili
Almost-correct specifications: a modular semantic framework for assigning confidence to warnings · Sam Blackshear, Shuvendu K. Lahiri
Asynchronous functional reactive programming for GUIs · Evan Czaplicki, Stephen Chong
AutoSynch: an automatic-signal monitor based on predicate tagging · Wei-Lun Hung, Vijay K. Garg
Automated feedback generation for introductory programming assignments · Rishabh Singh, Sumit Gulwani, Armando Solar-Lezama
CLAP: recording local executions to reproduce concurrency failures · Jeff Huang, Charles Zhang, Julian Dolby
CONCURRIT: a domain specific language for reproducing concurrency bugs · Tayfun Elmas, Jacob Burnim, George C. Necula, Koushik Sen
Compiler testing via a theory of sound optimisations in the C11/C++11 memory model · Robin Morisset, Pankaj Pawan, Francesco Zappa Nardelli
Complete completion using types and weights · Tihomir Gvero, Viktor Kuncak, Ivan Kuraj, Ruzica Piskac
Concurrent libraries with foresight · Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran Yahav
Dynamic determinacy analysis · Max Schäfer, Manu Sridharan, Julian Dolby, Frank Tip
Fast RMWs for TSO: semantics and implementation · Bharghava Rajaram, Vijay Nagarajan, Susmit Sarkar, Marco Elver
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis · Qirun Zhang, Michael R. Lyu, Hao Yuan, Zhendong Su
Fast condensation of the program dependence graph · Nick P. Johnson, Taewook Oh, Ayal Zaks, David I. August
Finding optimum abstractions in parametric dataflow analysis · Xin Zhang, Mayur Naik, Hongseok Yang
Formal verification of SSA-based optimizations for LLVM · Jianzhou Zhao, Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic
General data structure expansion for multi-threading · Hongtao Yu, Hou-Jen Ko, Zhiyuan Li
Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines · Jonathan Ragan-Kelley, Connelly Barnes, Andrew Adams, Sylvain Paris, Frédo Durand, Saman P. Amarasinghe
Harmonizing classes, functions, tuples, and type parameters in virgil iii · Ben L. Titzer
How to combine widening and narrowing for non-monotonic systems of equations · Kalmer Apinis, Helmut Seidl, Vesal Vojdani
Hybrid context-sensitivity for points-to analysis · George Kastrinis, Yannis Smaragdakis
It's alive! continuous feedback in UI programming · Sebastian Burckhardt, Manuel Fähndrich, Peli de Halleux, Sean McDirmid, Michal Moskal, Nikolai Tillmann + 1 more
Limitations of partial compaction: towards practical bounds · Nachshon Cohen, Erez Petrank
Look up!: your future is in the cloud · James R. Larus
Machine-verified network controllers · Arjun Guha, Mark Reitblatt, Nate Foster
Modular verification of linearizability with non-fixed linearization points · Hongjin Liang, Xinyu Feng
Monadic abstract interpreters · Ilya Sergey, Dominique Devriese, Matthew Might, Jan Midtgaard, David Darais, Dave Clarke + 1 more
Natural proofs for structure, data, and separation · Xiaokang Qiu, Pranav Garg, Andrei Stefanescu, Parthasarathy Madhusudan
Optimizing database-backed applications with query synthesis · Alvin Cheung, Armando Solar-Lezama, Samuel Madden
P: safe asynchronous event-driven programming · Ankush Desai, Vivek Gupta, Ethan K. Jackson, Shaz Qadeer, Sriram K. Rajamani, Damien Zufferey
Programming languages in security: keynote · Fred B. Schneider
Quipper: a scalable quantum programming language · Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron
Reasoning about nondeterminism in programs · Byron Cook, Eric Koskinen
Reconciling exhaustive pattern matching with objects · Chinawat Isradisaikul, Andrew C. Myers
Rely-guarantee references for refinement types over aliased mutable data · Colin S. Gordon, Michael D. Ernst, Dan Grossman
SMAT: an input adaptive auto-tuner for sparse matrix-vector multiplication · Jiajia Li, Guangming Tan, Mingyu Chen, Ninghui Sun
SPLLIFT: statically analyzing software product lines in minutes instead of years · Eric Bodden, Társis Tolêdo, Márcio Ribeiro, Claus Brabrand, Paulo Borba, Mira Mezini
Scalable variable and data type detection in a binary rewriter · Khaled Elwazeer, Kapil Anand, Aparna Kotha, Matthew Smithson, Rajeev Barua
Static analysis for probabilistic programs: inferring whole program properties from finitely many paths · Sriram Sankaranarayanan, Aleksandar Chakarov, Sumit Gulwani
Steal Tree: low-overhead tracing of work stealing schedulers · Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kalé
TRANSIT: specifying protocols with concolic snippets · Abhishek Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin, Rajeev Alur
Taming compiler fuzzers · Yang Chen, Alex Groce, Chaoqiang Zhang, Weng-Keen Wong, Xiaoli Z. Fern, Eric Eide + 1 more
Terra: a multi-stage language for high-performance computing · Zachary DeVito, James Hegarty, Alex Aiken, Pat Hanrahan, Jan Vitek
Thresher: precise refutations for heap reachability · Sam Blackshear, Bor-Yuh Evan Chang, Manu Sridharan
Translation validation for a verified OS kernel · Thomas Arthur Leck Sewell, Magnus O. Myreen, Gerwin Klein
Using managed runtime systems to tolerate holes in wearable memories · Tiejun Gao, Karin Strauss, Stephen M. Blackburn, Kathryn S. McKinley, Doug Burger, James R. Larus
Verifying higher-order programs with the dijkstra monad · Nikhil Swamy, Joel Weinberger, Cole Schlesinger, Juan Chen, Benjamin Livshits
When polyhedral transformations meet SIMD code generation · Martin Kong, Richard Veras, Kevin Stock, Franz Franchetti, Louis-Noël Pouchet, P. Sadayappan