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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-02317096
Contributor : Frédéric Loulergue <>
Submitted on : Tuesday, October 15, 2019 - 6:39:35 PM
Last modification on : Wednesday, October 16, 2019 - 1:31:24 AM

Identifiers

Citation

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⟩

Share

Metrics

Record views

42