Communications of the ACM
Latest Research
From Communications of the ACM
A Differential Approach to Undefined Behavior Detection
This paper studies undefined behavior arising in systems programming languages such as C/C++. We introduce a new static checker called STACK that precisely identifies...
From Communications of the ACM
Technical Perspective: Program Synthesis Using Stochastic Techniques
The authors of "Stochastic Program Optimization" have developed a stochastic search technique and applied it to program optimization.
From Communications of the ACM
Stochastic Program Optimization
By encoding constraints of transformation correctness as terms in a cost function, and using a Markov Chain Monte Carlo sampler to explore the space of all possible...
From Communications of the ACM
Technical Perspective: Catching Lies (and Mistakes) in Offloaded Computation
The system described in "Pinocchio: Nearly Practical Verifiable Computation" refines an important theoretical advance by Gennaro et al. Together, these two works represent...
From Communications of the ACM
Pinocchio: Nearly Practical Verifiable Computation
We introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions.
From Communications of the ACM
Technical Perspective: In-Situ Database Management
"NoDB: Efficient Query Execution on Raw Data Files" investigates extending a DBMS so it can use the file data in situ, without having to load it first.
From Communications of the ACM
NoDB: Efficient Query Execution on Raw Data Files
We here present the design and roadmap of a new paradigm in database systems, called NoDB, which do not require data loading while still maintaining the whole feature...
From Communications of the ACM
Technical Perspective: Treating Networks Like Programs
"Software Dataplane Verification" takes existing static checking of networks to a new level by checking the real code in the forwarding path of a Click router using...
From Communications of the ACM
Software Dataplane Verification
We present the result of working iteratively on two tasks: designing a domain-specific verification tool for packet-processing software, while trying to identify...
From Communications of the ACM
Technical Perspective: The Simplicity of Cache Efficient Functional Algorithms
In "Cache Efficient Functional Algorithms," Blelloch and Harper suggest we analyze the costs of functional algorithms by assuming objects are allocated sequentially...
From Communications of the ACM
Cache Efficient Functional Algorithms
We present a cost model for analyzing the memory efficiency of algorithms expressed in a simple functional language.
From Communications of the ACM
Technical Perspective: Virtual Reality in Your Living Room
The authors of IllumiRoom investigate what AR/VR could look like in a truly social environment — the living room.
From Communications of the ACM
Illumiroom: Immersive Experiences Beyond the TV Screen
IllumiRoom is a proof-of-concept system that surrounds a television with projected light, bringing video games, and film experiences out of the TV screen and into...
From Communications of the ACM
Technical Perspective: Programming Multicore Computers
"Can Traditional Programming Bridge the Ninja Performance Gap for Parallel Computing Applications" advocates an appealing division of labor between a developer...
From Communications of the ACM
Can Traditional Programming Bridge the Ninja Performance Gap For Parallel Computing Applications?
Current processor trends of integrating more cores with SIMD units have made it more to extract performance from applications. It is believed that traditional...
From Communications of the ACM
Technical Perspective: The Equivalence Problem For Finite Automata
As the equivalence problem is essential in many applications, we need algorithms that avoid the worst-case complexity as often as possible. In "Hacking Nondeterminism...
From Communications of the ACM
Hacking Nondeterminism with Induction and Coinduction
We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata.
From Communications of the ACM
Technical Perspective: Big Data Needs Approximate Computing
"Neural Acceleration for General-Purpose Approximate Programs" demonstrates the significant advantages in cost, power, and latency through approximate computing...
From Communications of the ACM
Neural Acceleration For General-Purpose Approximate Programs
This paper describes a new approach that uses machine learning-based transformations to accelerate approximation-tolerant programs.
From Communications of the ACM