A Verified Accumulate Algorithmic Skeleton - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A Verified Accumulate Algorithmic Skeleton

Abstract

This paper presents an extension of a library for the Coq interactive theorem prover that enables the development of correct functional parallel programs based on sequential program transformation and automatic parallelization using an algorithmic skeleton named accumulate. Such an algorithmic skeleton is a pattern of a parallel algorithm that is provided as a high-order function implemented in parallel. The use of this framework is illustrated with the bracket matching problem, including experiments on a parallel machine.
No file

Dates and versions

hal-02317096 , version 1 (15-10-2019)

Identifiers

Cite

Frédéric Loulergue. A Verified Accumulate Algorithmic Skeleton. 2017 Fifth International Symposium on Computing and Networking (CANDAR), Nov 2017, Aomori, France. pp.420-426, ⟨10.1109/CANDAR.2017.108⟩. ⟨hal-02317096⟩
48 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More