Formal validation of data-parallel programs: a two-component assertional proof system for a simple language

Bougé, Luc; Cachera, David; Guyadec, Yann Le; Utard, Gil; Virot, Bernard

doi:10.1016/s0304-3975(97)00041-8

Cited by 5 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So far several formal semantics have been proposed for data-parallel programming languages (e.g., [4,3,9]). The most prospective for our purpose would be the assertional approach by Bougé et al [4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic

Nishimura

2006

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

This paper proposes a modal extension of Separation Logic [8,11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logic provides a formal means for expressing allocation of disjoint substructures, which are to be processed in parallel. A modal operator is also introduced to relate the global property of a parallel operation with the local property of each sequential execution running in parallel. The effectiveness of the logic is demonstrated through a formal reasoning on the parallel list scan algorithm featuring the pointer jumping technique.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The most prospective for our purpose would be the assertional approach by Bougé et al [4]. However, they only deal with arrays as the primary data structure for parallel processing.…”

Section: Introductionmentioning

confidence: 99%

Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic

Nishimura

2006

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

show abstract

“…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%

A Structured Synchronization and Communication Model Fitting Irregular Data Accesses

Melin

Raffin

Rebeuf

et al. 1998

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

Introduction to the special issue on semantics and costs models for high-level parallel programming

Loulergue

2007

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

Formal validation of data-parallel programs: a two-component assertional proof system for a simple language

Cited by 5 publications

References 15 publications

Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic

Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic

A Structured Synchronization and Communication Model Fitting Irregular Data Accesses

Introduction to the special issue on semantics and costs models for high-level parallel programming

Contact Info

Product

Resources

About