Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: A Whitebox Solution for Blackbox-Like Behaviors
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...
From Communications of the ACM
DeepXplore: Automated Whitebox Testing of Deep Learning Systems
We design, implement, and evaluate DeepXplore, the first white-box framework for systematically testing real-world deep learning systems.
From Communications of the ACM
Technical Perspective: The Scalability of CertiKOS
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...
From Communications of the ACM
Building Certified Concurrent OS Kernels
In this work, we present CertiKOS, a novel compositional framework for building verified concurrent OS kernels.
From Communications of the ACM
Technical Perspective: From Virtual Worlds to Digital Fabrication
The authors of "OpenFab" propose to revisit the processing pipeline that turns a 3D model into machine instructions in light of the solutions developed in computer...
From Communications of the ACM
OpenFab: A Programmable Pipeline for Multimaterial Fabrication
We present OpenFab, a programmable pipeline for synthesis of multimaterial 3D printed objects that is inspired by RenderMan and modern GPU pipelines.
From Communications of the ACM
Technical Perspective: The True Cost of Popularity
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...
From Communications of the ACM
Heavy Hitters via Cluster-Preserving Clustering
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...
From Communications of the ACM
Technical Perspective: Do You Know Why Your Web Pages Load Faster?
"Taking a Long Look at QUIC," by Arash Molavi Kakhki et al., is a bold attempt to unearth the reasons why QUIC works better than TCP.
From Communications of the ACM
Taking a Long Look at QUIC: An Approach for Rigorous Evaluation of Rapidly Evolving Transport Protocols
There is a need for alternative techniques for understanding and evaluating QUIC when compared with previous transport-layer protocols.
From Communications of the ACM
Technical Perspective: Back to the Edge
"Heterogeneous Von Neumann/Dataflow Microprocessors" describes an innovative approach to exploit both CDFG and EDGE computation models.
From Communications of the ACM
Heterogeneous Von Neumann/Dataflow Microprocessors
This work studies the potential of a paradigm of heterogeneous execution models by developing a specialization engine for explicit-dataflow (SEED) and integrating...
From Communications of the ACM
Technical Perspective: Compressing Matrices for Large-Scale Machine Learning
Demand for more powerful big data analytics solutions has spurred the development of novel programming models, abstractions, and platforms. "Scaling Machine Learning...
From Communications of the ACM
Compressed Linear Algebra for Declarative Large-Scale Machine Learning
General-purpose compression struggles to achieve both good compression ratios and fast decompression for blockwise uncompressed operations. Therefore, we introduce...
From Communications of the ACM
Technical Perspective: Was Edgar Allan Poe Wrong After All?
Umesh Vazirani and Thomas Vidick's "Fully Device Independent Quantum Key Distribution" provides an unexpectedly simple and elegant secure protocol solution, indeed...
From Communications of the ACM
Fully Device Independent Quantum Key Distribution
We rigorously provide the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution.
From Communications of the ACM
Technical Perspective: Isolating a Matching When Your Coins Go Missing
Whether there exists a deterministic parallel algorithm for bipartite matching remains an outstanding question at the frontiers of our understanding of the role...
From Communications of the ACM
A Deterministic Parallel Algorithm for Bipartite Perfect Matching
In this article, we give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs.
From Communications of the ACM
Technical Perspective: Borrowing Big Code to Automate Programming Activities
"Predicting Program Properties from 'Big Code'" presents new techniques for leveraging big code to automate two programming activities: selecting understandable...
From Communications of the ACM