What is the right leak oracle that can precisely capture the behavior of leaks in Web applications? "BLeak: Automatically Debugging Memory Leaks in Web Applications...Harry Xu From Communications of the ACM | November 2020
This paper introduces BLeak (Browser Leak debugger), the first system for automatically debugging memory leaks in web applications.
John Vilk, Emery D. Berger From Communications of the ACM | November 2020
"MadMax: Analyzing the Out-of-Gas World of Smart Contracts," by Neville Grech et al., effectively discovers a new smart contract vulnerability, and proposes a detection...Benjamin Livshits From Communications of the ACM | October 2020
We identify gas-focused vulnerabilities and present MadMax: a static program analysis technique that automatically detects gas-focused vulnerabilities with very...Neville Grech, Michael Kong, Anton Jurisevic, Lexi Brent, Bernhard Scholz, Yannis Smaragdakis From Communications of the ACM | October 2020
"Lower Bounds for External Memory Integer Sorting via Network Coding" proves a remarkable connection between how efficiently computers can perform sorting and transmitting...Paul Beame From Communications of the ACM | October 2020
In this paper, we present a tight conditional lower bound on the complexity of external memory sorting of integers.
Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi From Communications of the ACM | October 2020
We show that by making just a few changes to a parallel/distributed relational database system, such a system can become a competitive platform for scalable linear...Shangyu Luo, Zekai J. Gao, Michael Gubanov, Luis L. Perez, Dimitrije Jankov, Christopher Jermaine From Communications of the ACM | August 2020
"Data-Driven Algorithm Design," by Rishi Gupta and Tim Roughgarden, addresses the issue that the best algorithm to use for many problems depends on what the input...Avrim Blum From Communications of the ACM | June 2020
The envy-free cake-cutting problem stood its ground for two decades, until it was cracked by Aziz and Mackenzie. Their solution is presented in "A Bounded and Envy...Ariel D. Procaccia From Communications of the ACM | April 2020
We report on our algorithm that resolved the well-studied cake cutting problem in which the goal is to find an envy-free allocation of a divisible resource based...Haris Aziz, Simon Mackenzie From Communications of the ACM | April 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
The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective...Graham Cormode From Communications of the ACM | August 2019
We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in...Kasper Green Larsen, Jelani Nelson, Huy L. Nguyễn, Mikkel Thorup From Communications of the ACM | August 2019