ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 39 Issue 2, May 2017

Don’t Sit on the Fence: A Static Analysis Approach to Automatic Fence Insertion
Jade Alglave, Daniel Kroening, Vincent Nimal, Daniel Poetzl
Article No.: 6
DOI: 10.1145/2994593

Modern architectures rely on memory fences to prevent undesired weakenings of memory consistency. As the fences’ semantics may be subtle, the automation of their placement is highly desirable. But precise methods for restoring consistency do...

Programs from Proofs: A Framework for the Safe Execution of Untrusted Software
Marie-Christine Jakobs, Heike Wehrheim
Article No.: 7
DOI: 10.1145/3014427

Today, software is traded worldwide on global markets, with apps being downloaded to smartphones within minutes or seconds. This poses, more than ever, the challenge of ensuring safety of software in the face of (1) unknown or untrusted software...

Towards a Compiler for Reals
Eva Darulova, Viktor Kuncak
Article No.: 8
DOI: 10.1145/3014426

Numerical software, common in scientific computing or embedded systems, inevitably uses a finite-precision approximation of the real arithmetic in which most algorithms are designed. In many applications, the roundoff errors introduced by...

Newtonian Program Analysis via Tensor Product
Thomas Reps, Emma Turetsky, Prathmesh Prabhu
Article No.: 9
DOI: 10.1145/3024084

Recently, Esparza et al. generalized Newton’s method—a numerical-analysis algorithm for finding roots of real-valued functions—to a method for finding fixed-points of systems of equations over semirings. Their method provides a...