Abstract
We present the SCRATCH tool, which uses bounded model checking and k-induction to automatically analyse software for multicore processors such as the Cell BE, in order to detect DMA races.
- M. Abadi and L. Lamport. The existence of refinement mappings. Theor. Comput. Sci., 82(2):253--284, 1991. Google Scholar
Digital Library
- A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Y. Zhu. Bounded model checking. Advances in Computers, 58:118--149, 2003.Google Scholar
- E. Clarke, D. Kroening, and F. Lerda. A tool for checking ANSI-C programs. In TACAS, pages 168--176, 2004.Google Scholar
Cross Ref
- A. F. Donaldson, D. Kroening, and P. Rümmer. Automatic analysis of scratch-pad memory code for heterogeneous multicore processors. In TACAS, pages 280--295, 2010. Google Scholar
Digital Library
- IBM. Cell BE resource center, October 2009. http://www.ibm.com/developerworks/power/cell/.Google Scholar
- M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a SAT-solver. In FMCAD, pages 108--125, 2000. Google Scholar
Digital Library
Index Terms
SCRATCH: a tool for automatic analysis of dma races
Recommendations
Automatic analysis of DMA races using model checking and k-induction
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small "scratch-pad" memories. The price for increased performance is higher programming complexity --- the programmer must ...
SCRATCH: a tool for automatic analysis of dma races
PPoPP '11: Proceedings of the 16th ACM symposium on Principles and practice of parallel programmingWe present the SCRATCH tool, which uses bounded model checking and k-induction to automatically analyse software for multicore processors such as the Cell BE, in order to detect DMA races.
Handling loops in bounded model checking of C programs via k-induction
The first attempts to apply the k-induction method to software verification are only recent. In this paper, we present a novel proof by induction algorithm, which is built on the top of a symbolic context-bounded model checker and uses an iterative ...







Comments