Calculating Parallel Programs in Coq using List Homomorphisms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Parallel Programming Year : 2017

Calculating Parallel Programs in Coq using List Homomorphisms

Abstract

SyDPaCC is a set of libraries for the Coq proof assistant. It allows to write naive functional programs (i.e. with high complexity) that are considered as specifications, and to transform them into more efficient versions. These more efficient versions can then be automatically parallelised before being extracted from Coq into source code for the functional language OCaml together with calls to the Bulk Synchronous Parallel ML (BSML) library. In this paper we present a new core version of SyDPaCC for the development of parallel programs correct-by-contruction using the theory of list homomorphisms and algorithmic skeletons implemented and verified in Coq. The framework is illustrated on the the maximum prefix sum problem.
Fichier principal
Vignette du fichier
article.pdf (348.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01159182 , version 1 (08-03-2016)

Licence

Copyright

Identifiers

Cite

Frédéric Loulergue, Wadoud Bousdira, Julien Tesson. Calculating Parallel Programs in Coq using List Homomorphisms. International Journal of Parallel Programming, 2017, 45 (2), pp.300-319. ⟨10.1007/s10766-016-0415-8⟩. ⟨hal-01159182⟩
358 View
402 Download

Altmetric

Share

Gmail Facebook X LinkedIn More