Mesa is a highly scalable analytic data warehousing system that stores critical measurement data related to Google's Internet advertising business. This paper presents...Ashish Gupta, Fan Yang, Jason Govig, Adam Kirsch, Kelvin Chan, Kevin Lai, Shuo Wu, Sandeep Dhoot, Abhilash Rajesh Kumar, Ankur Agiwal, Sanjay Bhansali, Mingsheng Hong, Jamie Cameron, Masood Siddiqi, David Jones, Jeff Shute, Andrey Gubarev, Shivakumar Venkataraman, Divyakant Agrawal From Communications of the ACM | July 2016
What kinds of problems can be solved with combined human and machine computation? "AutoMan: A Platform for Integrating Human-Based and Digital Computation," by...Siddharth Suri From Communications of the ACM | June 2016
We introduce AutoMan, the first fully automatic crowdprogramming system.Daniel W. Barowy, Charlie Curtsinger, Emery D. Berger, Andrew McGregor From Communications of the ACM | June 2016
"Enhancing Symbolic Execution with Veritesting" by Avgerinos et al. proposes an effective technique called veritesting that addresses the scalability limitations...Koushik Sen From Communications of the ACM | June 2016
In this article, we present a new technique for generating formulas called veritesting that alternates between static symbolic execution (SSE) and dynamic symbolic...Thanassis Avgerinos, Alexandre Rebert, Sang Kil Cha, David Brumley From Communications of the ACM | June 2016
In "Hiding Secrets in Software," Garg et al. construct a "one-way compiler" of the type envisioned by Diffie and Hellman.Boaz Barak From Communications of the ACM | May 2016
"On the Naturalness of Software" by Hindle et al. takes an entirely new approach to providing tools to help build software.Gail C. Murphy From Communications of the ACM | May 2016
We begin with the conjecture that most software is natural, with all the attendant constraints and limitations — and thus, like natural language, it is also likely...Abram Hindle, Earl T. Barr, Mark Gabel, Zhendong Su, Premkumar Devanbu From Communications of the ACM | May 2016
"A Fistful of Bitcoins" examines, in the context of Bitcoin, what we could learn by studying the patterns encoded in a complete record of every single financial...Emin GÜn Sirer From Communications of the ACM | April 2016
Bitcoin has the unintuitive property that while the ownership of money is implicitly anonymous, its flow is globally visible. In this paper we explore this unique...Sarah Meiklejohn, Marjori Pomarole, Grant Jordan, Kirill Levchenko, Damon McCoy, Geoffrey M. Voelker, Stefan Savage From Communications of the ACM | April 2016
"Secure Multiparty Computations on Bitcoin" introduces an exciting new idea for how to provide fairness: leverage Bitcoin’s existing infrastructure for distributed...David Wagner From Communications of the ACM | April 2016
In this work, we propose to use Bitcoin to design fully decentralized protocols that are secure even if no trusted third party is available.Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, Ćukasz Mazurek From Communications of the ACM | April 2016
In "Learning to Name Objects," the authors offer a method to determine a basic-level category name for an object in an image.David Forsyth From Communications of the ACM | March 2016
This paper looks at the problem of predicting category labels that mimic how human observers would name objects.Vicente Ordonez, Wei Liu, Jia Deng, Yejin Choi, Alexander C. Berg, Tamara L. Berg From Communications of the ACM | March 2016
In "A Differential Approach to Undefined Behavior Detection," Wang et al. hypothesize that any time a compiler is able to delete code by using reasoning based on...John Regehr From Communications of the ACM | March 2016
This paper studies undefined behavior arising in systems programming languages such as C/C++. We introduce a new static checker called STACK that precisely identifies...Xi Wang, Nickolai Zeldovich, M. Frans Kaashoek, Armando Solar-Lezama From Communications of the ACM | March 2016
The authors of "Stochastic Program Optimization" have developed a stochastic search technique and applied it to program optimization.
Sumit Gulwani From Communications of the ACM | February 2016
By encoding constraints of transformation correctness as terms in a cost function, and using a Markov Chain Monte Carlo sampler to explore the space of all possible...Eric Schkufza, Rahul Sharma, Alex Aiken From Communications of the ACM | February 2016
The system described in "Pinocchio: Nearly Practical Verifiable Computation" refines an important theoretical advance by Gennaro et al. Together, these two works represent...Michael Mitzenmacher, Justin Thaler From Communications of the ACM | February 2016
We introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions.
Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova From Communications of the ACM | February 2016