Safe asynchronous multicore memory operations

M. Bontincan, Mike Dodds, A.F. Donaldson, Matthew J. Parkinson

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Asynchronous memory operations provide a means for coping with the memory wall problem in multicore processors, and are available in many platforms and languages, e.g., the Cell Broadband Engine, CUDA and OpenCL. Reasoning about the correct usage of such operations involves complex analysis of memory accesses to check for races. We present a method and tool for proving memory-safety and race-freedom of multicore programs that use asynchronous memory operations. Our approach uses separation logic with permissions, and our tool automates this method, targeting a C-like core language. We describe our solutions to several challenges that arose in the course of this research. These include: syntactic reasoning about permissions and arrays, integration of numerical abstract domains, and utilization of an SMT solver. We demonstrate the feasibility of our approach experimentally by checking absence of DMA races on a set of programs drawn from the IBM Cell SDK.
Original languageEnglish
Title of host publicationAutomated Software Engineering (ASE), 2011 26th IEEE/ACM International Conference on
Number of pages10
ISBN (Print)978-1-4577-1638-6
Publication statusPublished - 2011
Event26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011) - Kansas, Lawrence, United Kingdom
Duration: 6 Nov 201112 Nov 2011


Conference26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)
Country/TerritoryUnited Kingdom

Cite this