Sign In

Communications of the ACM

Latest Research



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...

Building Certified Concurrent OS Kernels
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: 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...

Heavy Hitters via Cluster-Preserving Clustering
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: 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...

Fully Device Independent Quantum Key Distribution
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...

A Deterministic Parallel Algorithm for Bipartite Perfect Matching
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...

Predicting Program Properties from 'Big Code'
From Communications of the ACM

Predicting Program Properties from 'Big Code'

We present a new approach for predicting program properties from large codebases (aka "Big Code").

From Communications of the ACM

Technical Perspective: How Economic Theories Can Help Computers Beat the Heat

The authors of "Distributed Strategies for Computational Sprints" bring the rich theory of allocating scarce resources to the challenge of managing computational...

Distributed Strategies for Computational Sprints
From Communications of the ACM

Distributed Strategies for Computational Sprints

We describe a computational sprinting architecture in which many, independent chip multiprocessors share a power supply and sprints are constrained by the chips'...

From Communications of the ACM

Technical Perspective: To Do or Not To Do: Extending SQL with Integer Linear Programming?

"Scalable Computation of High-Order Optimization Queries," by Brucato et al., makes a case for marrying the well-established paradigms of constrained optimization...

Scalable Computation of High-Order Optimization Queries
From Communications of the ACM

Scalable Computation of High-Order Optimization Queries

We present a complete system that supports package queries, a new query model that extends traditional database queries to handle complex constraints and preferences...

From Communications of the ACM

Technical Perspective: WebAssembly: A Quiet Revolution of the Web

"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...

Bringing the Web ­Up to Speed with WebAssembly
From Communications of the ACM

Bringing the Web ­Up to Speed with WebAssembly

WebAssembly is the first mainstream language designed from the start with a formal semantics. It not only demonstrates the feasibility of applying formal techniques...

From Communications of the ACM

Technical Perspective: Node Replication Divides to Conquer

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...

How to Implement Any Concurrent Data Structure
From Communications of the ACM

How to Implement Any Concurrent Data Structure

We propose a method called Node Replication (NR) to implement any concurrent data structure.

From Communications of the ACM

Technical Perspective: The Future of MPI

"Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided" convincingly shows that the potential of MPI one-sided communication can be realized...

Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided
From Communications of the ACM

Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided

In this work, we design and develop bufferless protocols that demonstrate how to implement the MPI-3 RMA interface and support scaling to millions of cores.
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account