Sciweavers

PLDI
2015
ACM
8 years 23 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 23 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 23 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 23 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 23 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 23 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 23 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 23 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...
PLDI
2015
ACM
8 years 23 days ago
Synthesizing parallel graph programs via automated planning
We describe a system that uses automated planning to synthesize correct and efficient parallel graph programs from high-level algorithmic specifications. Automated planning allo...
Dimitrios Prountzos, Roman Manevich, Keshav Pingal...
PLDI
2015
ACM
8 years 23 days ago
Compiling APL to accelerate through a typed array intermediate language
We present an approach for compiling a rich subset of APL into dataparallel programs that can be executed on GPUs. The compiler is based on the APLTAIL compiler, which compiles AP...
Michael Budde, Martin Dybdal, Martin Elsman