In EDS ansehen

Calculating Parallel Programs in Coq Using List Homomorphisms.

Gespeichert in:
Bibliographische Detailangaben
Titel: Calculating Parallel Programs in Coq Using List Homomorphisms.
Autoren: Loulergue, Frédéric, Bousdira, Wadoud, Tesson, Julien
Quelle: International Journal of Parallel Programming; Apr2017, Vol. 45 Issue 2, p300-319, 20p
Schlagwörter: PARALLEL programs (Computer programs), PARALLEL computers, PARALLEL programming, PROGRAMMING languages, COMPUTER software
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 library. In this paper we present a new core version of SyDPaCC for the development of parallel programs correct-by-construction using the theory of list homomorphisms and algorithmic skeletons implemented and verified in Coq. The framework is illustrated on the maximum prefix sum problem. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
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 library. In this paper we present a new core version of SyDPaCC for the development of parallel programs correct-by-construction using the theory of list homomorphisms and algorithmic skeletons implemented and verified in Coq. The framework is illustrated on the maximum prefix sum problem. [ABSTRACT FROM AUTHOR]
ISSN:08857458
DOI:10.1007/s10766-016-0415-8