Proceedings of the International Workshop on OpenCL 2013 &Amp; 2014 - IWOCL '14 2014
DOI: 10.1145/2664666.2664673
|View full text |Cite
|
Sign up to set email alerts
|

KernelInterceptor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 9 publications
0
2
0
1
Order By: Relevance
“…To the best of our knowledge, this is the first mechanized proof of correctness of a DRF analysis for GPU programs. (3) We show that our DRF analysis of access memory protocols is compositional when protocols satisfy a structural property, see Theorem 2. Additionally, we show how to transform protocols when they do not meet this property.…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…To the best of our knowledge, this is the first mechanized proof of correctness of a DRF analysis for GPU programs. (3) We show that our DRF analysis of access memory protocols is compositional when protocols satisfy a structural property, see Theorem 2. Additionally, we show how to transform protocols when they do not meet this property.…”
Section: Introductionmentioning
confidence: 91%
“…They also require code annotations from a concurrency expert to handle loops. GPUVerify [2,3,5,6,12] can verify CUDA and OpenCL kernels using Boogie [4] as a backend. GPUVerify also relies on a two-thread abstraction (pen and paper proof)-in this paper, we present the first machine-checked proof of the two-thread abstraction idea.…”
Section: Related Workmentioning
confidence: 99%
“…Test Amplification busca detectar condições de disputa executando o programa, e usando análise estática para ampliar o alcance do teste (LEUNG et al, 2012). GPUVerify também verifica condições de disputa utilizando análise estática (BETTS et al, 2012b;CHONG et al, 2013;COLLINGBOURNE et al, 2013;BARDSLEY;DONALDSON;WICKERSON, 2014;CHONG;DONALDSON;KETEMA, 2014;BARDSLEY;BETTS et al, 2015;DONALDSON et al, 2017;BETTS et al, 2018). LD verifica condições de disputa em memória compartilhada sem realizar a instrumentação do código, usando verificação baseada em valor (value-based checking) (LI; DING, 2014) (LI et al, 2017) .…”
Section: Trabalhos Relacionadosunclassified