Sciweavers

PLDI
2015
ACM
8 years 8 days ago
Autotuning algorithmic choice for input sensitivity
A daunting challenge faced by program performance autotuning is input sensitivity, where the best autotuned configuration may vary with different input sets. This paper presents ...
Yufei Ding, Jason Ansel, Kalyan Veeramachaneni, Xi...
PLDI
2015
ACM
8 years 8 days ago
Verifying read-copy-update in a logic for weak memory
Read-Copy-Update (RCU) is a technique for letting multiple readers safely access a data structure while a writer concurrently modifies it. It is used heavily in the Linux kernel ...
Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis
PLDI
2015
ACM
8 years 8 days ago
Declarative programming over eventually consistent data stores
User-facing online services utilize geo-distributed data stores to minimize latency and tolerate partial failures, with the intention to provide a fast, always-on experience. Howe...
K. C. Sivaramakrishnan, Gowtham Kaki, Suresh Jagan...
PLDI
2015
ACM
8 years 8 days ago
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
With hundreds of millions of users, spreadsheets are one of the most important end-user applications. Spreadsheets are easy to use and allow users great flexibility in storing da...
Daniel W. Barowy, Sumit Gulwani, Ted Hart, Benjami...
PLDI
2015
ACM
8 years 8 days ago
Interactive parser synthesis by example
Despite decades of research on parsing, the construction of parsers remains a painstaking, manual process prone to subtle bugs and pitfalls. We present a programming-by-example fr...
Alan Leung, John Sarracino, Sorin Lerner
PLDI
2015
ACM
8 years 8 days ago
Exploring and enforcing security guarantees via program dependence graphs
We present PIDGIN, a program analysis and understanding tool that enables the specification and enforcement of precise applicationspecific information security guarantees. PIDGI...
Andrew Johnson, Lucas Waye, Scott Moore, Stephen C...
PLDI
2015
ACM
8 years 8 days ago
Improving compiler scalability: optimizing large programs at small price
Compiler scalability is a well known problem: reasoning about the application of useful optimizations over large program scopes consumes too much time and memory during compilatio...
Sanyam Mehta, Pen-Chung Yew
PLDI
2015
ACM
8 years 8 days ago
Static detection of asymptotic performance bugs in collection traversals
This paper identifies and formalizes a prevalent class of asymptotic performance bugs called redundant traversal bugs and presents a novel static analysis for automatically detec...
Oswaldo Olivo, Isil Dillig, Calvin Lin
PLDI
2015
ACM
8 years 8 days ago
Diagnosing type errors with class
Type inference engines often give terrible error messages, and the more sophisticated the type system the worse the problem. We show that even with the highly expressive type syst...
Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniot...
PLDI
2015
ACM
8 years 8 days ago
Tree dependence analysis
We develop a new framework for analyzing recursive methods that perform traversals over trees, called tree dependence analysis. This analysis translates dependence analysis techni...
Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Li...