acm-header
Sign In

Communications of the ACM

Latest Research



From Communications of the ACM

Technical Perspective: Complex Financial Products: Caveat Emptor

CDOs are examples of financial derivatives, with a value that depends on the underlying assets with which they are linked. These kinds of complex financial products...

Computational Complexity and Information Asymmetry in Financial Products
From Communications of the ACM

Computational Complexity and Information Asymmetry in Financial Products

Securitization of cash flows using financial derivatives transformed the financial industry over the last three decades. Derivatives...

Poly-Logarithmic Independence Fools Bounded-Depth Boolean Circuits
From Communications of the ACM

Poly-Logarithmic Independence Fools Bounded-Depth Boolean Circuits

The question of determining which (weak) forms of randomness "fool" (or seem totally random to) a given algorithm is a basic...

From Communications of the ACM

Technical Perspective: Patterns Hidden from Simple Algorithms

Is the number 9021960864034418159813 random? To my limited mind, the string  appears random. Is there a way to use some formal mathematics...

Liability Issues in Software Engineering
From Communications of the ACM

Liability Issues in Software Engineering: The Use of Formal Methods to Reduce Legal Uncertainties

This paper reports on the results of a multidisciplinary project involving lawyers and computer scientists with the aim to put forward a set of methods and tools...

From Communications of the ACM

Technical Perspective: Liability Issues in Software Engineering

The paper by LeMétayer et al. addresses one technical issue in a large and serious problem in the production...

QIP = PSPACE
From Communications of the ACM

QIP = PSPACE

The collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable with an ordinary classical computer...

From Communications of the ACM

Technical Perspective: QIP = PSPACE Breakthrough

It is now clear that for a wide range of problems, quantum computers offer little or no advantage over their classical counterparts.

FastTrack: Efficient and Precise Dynamic Race Detection
From Communications of the ACM

FastTrack: Efficient and Precise Dynamic Race Detection

Multithreaded programs are notoriously prone to race conditions. Prior work developed precise dynamic race detectors that never report false alarms. However, these...

Goldilocks: A Race-Aware Java Runtime
From Communications of the ACM

Goldilocks: A Race-Aware Java Runtime

GOLDILOCKS is a Java runtime that monitors program executions and throws a DataRaceException when a data race...

From Communications of the ACM

Technical Perspective: Data Races Are Evil with No Exceptions

Exploiting parallelism has become the primary means to higher performance. Shared memory is a pervasively used programming...

Difference Engine: Harnessing Memory Redundancy in Virtual Machines
From Communications of the ACM

Difference Engine: Harnessing Memory Redundancy in Virtual Machines

Virtual machine monitors are a popular platform for Internet hosting centers and cloud-based compute services. But main memory is not amenable to multiplexed hardware...

From Communications of the ACM

Technical Perspective: A VM 'Engine' That Makes a Difference

The past decade has witnessed a renaissance in server virtualization. Diwaker Gupta et al. present a novel approach for significantly improving the efficiency of...

Constraint Satisfaction Problems and Global Cardinality Constraints
From Communications of the ACM

Constraint Satisfaction Problems and Global Cardinality Constraints

In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality...

From Communications of the ACM

Technical Perspective: Constraint Satisfaction Problems and Computational Complexity

It takes little imagination to come up with a wealth of problems in scheduling and planning that can be expressed asConstraint Satisfaction...

Reasoning About the Unknown in Static Analysis
From Communications of the ACM

Reasoning About the Unknown in Static Analysis

Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis...

From Communications of the ACM

Technical Persepctive: Large-Scale Sound and Precise Program Analysis

You are given a program. Will it crash? Is it subject to a spoofing, buffer overflow, or injection attack? Is this part of...

X86-TSO: A Rigorous and Usable Programmer's Model For X86 Multiprocessors
From Communications of the ACM

X86-TSO: A Rigorous and Usable Programmer's Model For X86 Multiprocessors

Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code. However, concurrent programming...

From Communications of the ACM

Technical Perspective: A Solid Foundation For X86 Shared Memory

Multithreaded programs that communicate through shared memory are pervasive. Today they are the most obvious...

seL4: Formal Verification of an Operating-System Kernel
From Communications of the ACM

seL4: Formal Verification of an Operating-System Kernel

We report on the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. We assume correctness...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account