1996
DOI: 10.1007/3-540-61736-1_51
|View full text |Cite
|
Sign up to set email alerts
|

Formal validation of data parallel programs: Introducing the assertional approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1996
1996
2008
2008

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Through the defined functional language, semantics of some parallel data types and the operations on them were studied, and some laws for the transformations of programs and data were proved, etc. The INRIA second study [5] was based on the assertional approach. A new language L, which has the common control structures of some data parallel languages, was defined, and a proof system was built on it.…”
Section: Related Workmentioning
confidence: 99%
“…Through the defined functional language, semantics of some parallel data types and the operations on them were studied, and some laws for the transformations of programs and data were proved, etc. The INRIA second study [5] was based on the assertional approach. A new language L, which has the common control structures of some data parallel languages, was defined, and a proof system was built on it.…”
Section: Related Workmentioning
confidence: 99%
“…Programs are deterministic and deadlock free. Synchronism makes program design and verification easier [3,4,14] by enabling syntaxdriven program reading. Nevertheless, the model is too restrictive to handle irregular data accesses.…”
Section: Introductionmentioning
confidence: 99%