2014
DOI: 10.1016/j.scico.2014.03.013
|View full text |Cite
|
Sign up to set email alerts
|

Specification and verification of GPGPU programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
61
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

5
2

Authors

Journals

citations
Cited by 48 publications
(62 citation statements)
references
References 3 publications
0
61
0
1
Order By: Relevance
“…Moreover, it means that in future versions we can simplify the permission model to three values: no access, read access, full access. Our kernel logic imposes proof obligations to ensure that all resources are always properly distributed [4]. The tool verifies these proof obligations by encoding them as specified methods and classes.…”
Section: The Vercors Specification Languagementioning
confidence: 99%
“…Moreover, it means that in future versions we can simplify the permission model to three values: no access, read access, full access. Our kernel logic imposes proof obligations to ensure that all resources are always properly distributed [4]. The tool verifies these proof obligations by encoding them as specified methods and classes.…”
Section: The Vercors Specification Languagementioning
confidence: 99%
“…In the approached proposed in [21], kernels, work groups, threads, and barriers are specified and verified modularly w.r.t. their specifications.…”
Section: Reasoning About Gpgpu Programsmentioning
confidence: 99%
“…[21] and the example use the first approach, which is efficient for proving data race freedom. In the rest of this chapter, we use the second approach, which is more convenient for functional properties, as it ensures all functional properties are properly framed [21].…”
Section: Reasoning About Gpgpu Programsmentioning
confidence: 99%
See 2 more Smart Citations