静态竞争检测中的可证GPU数据竞争
Provable GPU Data-Races in Static Race Detection
摘要:
我们扩展了Faial工具链背后的理论,该理论可以充分证明CUDA程序(又名内核)使用称为内存访问协议(MAP)的专门行为类型是无数据竞争的。在本文中,我们扩展理论的地图来表征内核的报警可以被识别为真正的报警。我们介绍了CUDA的核心演算,我们将其命名为BabyCUDA,以及它的行为类型系统。我们表明,如果可以为BabyCUDA程序分配MAP,那么Faial对此程序发出的任何警报都是真正的警报。
英文摘要:
We extend the theory behind the Faial tool-chain, which can soundly prove that CUDA programs (aka, kernels) are data-race free using specialized behavioral types called memory access protocols (MAPs). In this paper we extend the theory of MAPs to characterize kernels for which alarms can be identified as true alarms. We introduce a core calculus for CUDA, which we named BabyCUDA, and a behavioral type system for it. We show that if a BabyCUDA program can be assigned a MAP, then any alarm raised by Faial for this program is a true alarm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。