1994
DOI: 10.1007/3-540-58430-7_10
|View full text |Cite
|
Sign up to set email alerts
|

On the expressivity of a weakest precondition calculus for a simple data-parallel programming language (short version)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1995
1995
2001
2001

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…Bouge et al [1,2] defined both axiomatic and denotational semantics for a "low level" data-parallel language £, which gives instructions and control constructs including Skip, Assignment, Communication, Sequencing and iteration. They also define an intermediate data-parallel language where asynchronism becomes explicit in the syntax.…”
Section: Related Workmentioning
confidence: 99%
“…Bouge et al [1,2] defined both axiomatic and denotational semantics for a "low level" data-parallel language £, which gives instructions and control constructs including Skip, Assignment, Communication, Sequencing and iteration. They also define an intermediate data-parallel language where asynchronism becomes explicit in the syntax.…”
Section: Related Workmentioning
confidence: 99%
“…Data parallelism [2] [3] [7] [12] [14] [16] is a structure for specifying scientific computations (usually representations of numerical algorithms) which are to be executed on multi-processor machines. Data parallel computation is attractive because (i) many scientific applications can be conveniently described and efficiently implemented in the framework; and (ii) it is conceptually simpler than many alternative models (for example, CSP [11] and BSP [15]).…”
Section: Introductionmentioning
confidence: 99%