International Journal of Parallel Programming

, Volume 44, Issue 3, pp 574–597

BSP-Why: A Tool for Deductive Verification of BSP Algorithms with Subgroup Synchronisation

Article

DOI: 10.1007/s10766-015-0360-y

Cite this article as:
Fortin, J. & Gava, F. Int J Parallel Prog (2016) 44: 574. doi:10.1007/s10766-015-0360-y

Abstract

We present bsp-why, a tool for deductive verification of bsp  algorithms with subgroup synchronisation. From bsp  programs, bsp-why generates sequential codes for the back-end condition generator why and thus benefits from its large range of existing provers. By enabling subgroups, the user can prove the correctness of programs that run on hierarchical machines—e.g. clusters of multi-cores. In general, bsp-why is able to generate proof obligations of mpi programs that only use collective operations. Our case studies are distributed state-space construction algorithms, the basis of model-checking.

Keywords

bsp Verification Subgroup synchronisation State-space 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.LACLUniversity of Paris-EastCréteilFrance