Software misbehaves all too often. This is a truism, but also the driving force behind many computing techniques intended to increase software reliability, safety...Xavier Leroy From Communications of the ACM | December 2011
High-level computer applications build on services provided by lower-level software layers. Unfortunately, today's low-level software still suffers from a steady...Jean Yang, Chris Hawblitzel From Communications of the ACM | December 2011
The following paper combines two important themes in secure computing: assurance and information flow control. For high assurance, a system's Trusted Computing...Butler Lampson From Communications of the ACM | November 2011
Features of the new HiStar operating system permit several novel applications, including privacy-preserving, untrusted virus scanners and a dynamic Web server with...Nickolai Zeldovich, Silas Boyd-Wickizer, Eddie Kohler, David Mazières From Communications of the ACM | November 2011
Semanticss-based program analysis requires one to (1) start from a "friendly" semantics; (2) design a "congenial" lattice...Olivier Danvy, Jan Midtgaard From Communications of the ACM | September 2011
Predictive models are fundamental to engineering reliable software systems. However, designing conservative, computable approximations for the behavior of programs...David Van Horn, Matthew Might From Communications of the ACM | September 2011
Windows Error Reporting (WER) is a distributed system that automates the processing of error reports coming from an installed base of a billion machines. WER has...Kinshuman Kinshumann, Kirk Glerum, Steve Greenberg, Gabriel Aul, Vince Orgovan, Greg Nichols, David Grant, Gretchen Loihle, Galen Hunt From Communications of the ACM | July 2011
Scale has been the single most important force driving changes in system software over the last decade. Its impact is...John Ousterhout From Communications of the ACM | July 2011
The emergence of wimpy processors and FLASH met a promising deployment scenario in the field of large-scale data centers. The energy efficiency potential of these...Luiz André Barroso From Communications of the ACM | July 2011
This paper presents a fast array of wimpy nodes — FAWN — an approach for achieving low-power data-intensive data-center computing.
David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan From Communications of the ACM | July 2011
Dremel is a scalable, interactive ad hoc query system for analysis of read-only nested data. By combining multilevel execution trees and columnar data layout, it...Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis From Communications of the ACM | June 2011
The importance of data analysis has never been clearer. Globe-spanning scientific collaborations are exploring...Michael J. Franklin From Communications of the ACM | June 2011
CDOs are examples of financial derivatives, with a value that depends on the underlying assets with which they are linked. These kinds of complex financial products...David C. Parkes From Communications of the ACM | May 2011
Securitization of cash flows using financial derivatives transformed the financial industry over the last three decades. Derivatives...Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge From Communications of the ACM | May 2011
The question of determining which (weak) forms of randomness "fool" (or seem totally random to) a given algorithm is a basic...Mark Braverman From Communications of the ACM | April 2011
Is the number 9021960864034418159813 random? To my limited mind, the string appears random. Is there a way to use some formal mathematics...Madhu Sudan From Communications of the ACM | April 2011
This paper reports on the results of a multidisciplinary project involving lawyers and computer scientists with the aim to put forward a set of methods and tools...Daniel Le Métayer, Manuel Maarek, Eduardo Mazza, Marie-Laure Potet, Stéphane Frénot, Valérie Viet Triem Tong, Nicolas Craipeau, Ronan Hardouin From Communications of the ACM | April 2011
The paper by LeMétayer et al. addresses one technical issue in a large and serious problem in the production...Daniel M. Berry From Communications of the ACM | April 2011
The collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable with an ordinary classical computer...Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous From Communications of the ACM | December 2010
It is now clear that for a wide range of problems, quantum computers offer little or no advantage over their classical counterparts.
Scott Aaronson From Communications of the ACM | December 2010