We here present the design and roadmap of a new paradigm in database systems, called NoDB, which do not require data loading while still maintaining the whole feature...Ioannis Alagiannis, Renata Borovica-Gajic, Miguel Branco, Stratos Idreos, Anastasia Ailamaki From Communications of the ACM | December 2015
"Software Dataplane Verification" takes existing static checking of networks to a new level by checking the real code in the forwarding path of a Click router using...George Varghese From Communications of the ACM | November 2015
We present the result of working iteratively on two tasks: designing a domain-specific verification tool for packet-processing software, while trying to identify...Mihai Dobrescu, Katerina Argyraki From Communications of the ACM | November 2015
In "Cache Efficient Functional Algorithms," Blelloch and Harper suggest we analyze the costs of functional algorithms by assuming objects are allocated sequentially...William D. Clinger From Communications of the ACM | July 2015
We present a cost model for analyzing the memory efficiency of algorithms expressed in a simple functional language.Guy E. Blelloch, Robert Harper From Communications of the ACM | July 2015
The authors of IllumiRoom investigate what AR/VR could look like in a truly social environment — the living room.Patrick Baudisch From Communications of the ACM | June 2015
IllumiRoom is a proof-of-concept system that surrounds a television with projected light, bringing video games, and film experiences out of the TV screen and into...Brett R. Jones, Hrvoje Benko, Eyal Ofek, Andrew D. Wilson From Communications of the ACM | June 2015
"Can Traditional Programming Bridge the Ninja Performance Gap for Parallel Computing Applications" advocates an appealing division of labor between a developer...James Larus From Communications of the ACM | May 2015
Current processor trends of integrating more cores with SIMD units have made it more to extract performance from applications. It is believed that traditional...Nadathur Satish, Changkyu Kim, Jatin Chhugani, Hideki Saito, Rakesh Krishnaiyer, Mikhail Smelyanskiy, Milind Girkar, Pradeep Dubey From Communications of the ACM | May 2015
As the equivalence problem is essential in many applications, we need algorithms that avoid the worst-case complexity as often as possible. In "Hacking Nondeterminism...Thomas A. Henzinger, Jean-François Raskin From Communications of the ACM | February 2015
We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata.Filippo Bonchi, Damien Pous From Communications of the ACM | February 2015
"Neural Acceleration for General-Purpose Approximate Programs" demonstrates the significant advantages in cost, power, and latency through approximate computing...Ravi Nair From Communications of the ACM | January 2015
This paper describes a new approach that uses machine learning-based transformations to accelerate approximation-tolerant programs.Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, Doug Burger From Communications of the ACM | January 2015
The following paper is a breakthrough in which the authors offer a formula to calculate the probability of reading data that was not written by one of the K most...Philip A. Bernstein From Communications of the ACM | August 2014
Eventual consistency is often "good enough" for practitioners given its latency and availability benefits. In this work, we explain this phenomenon and demonstrate...Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, Ion Stoica From Communications of the ACM | August 2014
An ideal scheme for password storage would enable a password with more than 20 bits of randomness to be input and output from the brain of a human being who is...Ari Juels, Bonnie Wong From Communications of the ACM | May 2014
We present a defense against coercion attacks using the concept of implicit learning from cognitive psychology. We use a carefully crafted computer game to allow...Hristo Bojinov, Daniel Sanchez, Paul Reber, Dan Boneh, Patrick Lincoln From Communications of the ACM | May 2014
Today's smartphone operating systems frequently fail to provide users with adequate control over and visibility into how third-party applications use their privacy...William Enck, Peter Gilbert, Byung-Gon Chun, Landon P. Cox, Jaeyeon Jung, Patrick McDaniel, Anmol N. Sheth From Communications of the ACM | March 2014
In quite a tour de force, the authors of the following paper have built a provably correct real-time garbage collector for reconfigurable hardware (field programmable...Eliot Moss From Communications of the ACM | December 2013