.png){kind=icon}
Return
Deductively verifying functional scalable parallel programs with Why3
.png){kind=icon}
PRE
AI
DOI：10.1007/s10270-025-01340-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Bulk synchronous parallelism (BSP) is a simple, yet realistic, model of scalable parallel computing. BSML is a pure functional library for the multi-paradigm language OCaml that embodies the principles of BSP. We propose a formalization of BSML primitives with WhyML, the specification language of Why3 and specify and prove the correctness of a set of parallel functions forming a standard library. We develop and verify the correctness of small BSML applications based on transformation theorems and the correspondence of a set of sequential functions on lists with algorithmic skeletons, i.e., functions implemented in parallel and manipulating distributed lists. Leveraging the Why3 feature generating OCaml code from WhyML code, we experiment these applications on parallel machines.
Keywords:
Software engineering
Formal methods
Scalable parallel computing
Functional programming
Deductive verification
Why3
Journal
S
IF:
3.2
Papers:
61
Citations:
1.9K
Organization
Cited Papers
.png){kind=icon}
ShareSaveFormal derivation and extraction of a parallel program for the all nearest smaller values problem
PREAI
ShareSaveShareSaveShareSave
A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification
PREAI
ShareSave
View more