There are few algorithms for multi-flow graphs beyond flow accumulation. The authors of "Flood-Risk Analysis on Terrains" take a big step to fill this knowledge...Shashi Shekhar From Communications of the ACM | September 2020
In this paper, we study a number of flood-risk related problems, give an overview of efficient algorithms for them, as well as explore the efficacy and efficiency...Aaron Lowe, Pankaj K. Agarwal, Mathias Rav From Communications of the ACM | September 2020
"Computing Value of Spatiotemporal Information," by Heba Aly et al., describes a technique for computing the monetary value of a person's location data for a potential...Cyrus Shahabi From Communications of the ACM | September 2020
We investigate the intrinsic value of location data in the context of strong privacy, where location information is only available from end users via purchase.
...Heba Aly, John Krumm, Gireeja Ranade, Eric Horvitz From Communications of the ACM | September 2020
Can we build purpose-built, warehouse-scale datacenters customized for large-scale arrays of ASIC accelerators or, to use a term coined in the paper by Michael...Parthasarathy Ranganathan From Communications of the ACM | July 2020
This paper distills lessons from Bitcoin ASIC Clouds and applies them to other large scale workloads, showing superior TCO (total cost of ownership) versus CPU...Michael Bedford Taylor, Luis Vega, Moein Khazraee, Ikuo Magaki, Scott Davidson, Dustin Richmond From Communications of the ACM | July 2020
Instead of handing trace records off to a collector for long-term storage and future processing, the system described in "Pivot Tracing: Dynamic Causal Monitoring...Rebecca Isaacs From Communications of the ACM | March 2020
This paper presents Pivot Tracing, a monitoring framework for distributed systems, which addresses the limitations of today's monitoring and diagnosis tools by...Jonathan Mace, Ryan Roelke, Rodrigo Fonseca From Communications of the ACM | March 2020
DeepXplore brings a software testing perspective to deep neural networks and, in doing so, creates the opportunity for enormous amounts of follow-on work in several...David G. Andersen From Communications of the ACM | November 2019
We design, implement, and evaluate DeepXplore, the first white-box framework for systematically testing real-world deep learning systems.
Kexin Pei, Yinzhi Cao, Junfeng Yang, Suman Jana From Communications of the ACM | November 2019
The authors of "Building Certified Concurrent OS Kernels" illustrate that formal verification can scale up to a moderate-size program (6,500 lines of C) that has...Andrew W. Appel From Communications of the ACM | October 2019
In this work, we present CertiKOS, a novel compositional framework for building verified concurrent OS kernels.
Ronghui Gu, Zhong Shao, Hao Chen, Jieung Kim, Jérémie Koenig, Xiongnan (Newman) Wu, Vilhelm Sjöberg, David Costanzo From Communications of the ACM | October 2019
"Predicting Program Properties from 'Big Code'" presents new techniques for leveraging big code to automate two programming activities: selecting understandable...Martin C. Rinard From Communications of the ACM | March 2019
"Scalable Computation of High-Order Optimization Queries," by Brucato et al., makes a case for marrying the well-established paradigms of constrained optimization...Surajit Chaudhuri From Communications of the ACM | February 2019
We present a complete system that supports package queries, a new query model that extends traditional database queries to handle complex constraints and preferences...Matteo Brucato, Azza Abouzied, Alexandra Meliou From Communications of the ACM | February 2019
"Bringing the Web Up to Speed with WebAssembly," by Rossberg et al., gives an overview of the initial design of WebAssembly, a new low-level programming language...Anders Møller From Communications of the ACM | December 2018
WebAssembly is the first mainstream language designed from the start with a formal semantics. It not only demonstrates the feasibility of applying formal techniques...Andreas Rossberg, Ben L. Titzer, Andreas Haas, Derek L. Schuff, Dan Gohman, Luke Wagner, Alon Zakai, J. F. Bastien, Michael Holman From Communications of the ACM | December 2018
In "How to Implement Any Concurrent Data Structure," Calciu et al. show that a concurrent data structure can be built automatically and that its performance is...Tim Harris From Communications of the ACM | December 2018
We propose a method called Node Replication (NR) to implement any concurrent data structure.
Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera From Communications of the ACM | December 2018