DocumentCode :
3644751
Title :
Safe asynchronous multicore memory operations
Author :
Matko Botinčan;Mike Dodds;Alastair F. Donaldson;Matthew J. Parkinson
Author_Institution :
University of Cambridge, UK
fYear :
2011
Firstpage :
153
Lastpage :
162
Abstract :
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.
Keywords :
"Instruction sets","Cognition","Multicore processing","Computer bugs","Microprocessors","Logic arrays"
Publisher :
ieee
Conference_Titel :
Automated Software Engineering (ASE), 2011 26th IEEE/ACM International Conference on
ISSN :
1938-4300
Print_ISBN :
978-1-4577-1638-6
Type :
conf
DOI :
10.1109/ASE.2011.6100049
Filename :
6100049
Link To Document :
بازگشت