BSP-WHY: an intermediate language for deductive verification of BSP programs

  • Authors:
  • Jean Fortin;Frédéric Gava

  • Affiliations:
  • University of Paris-East, Créteil, France;University of Paris-East, Créteil, France

  • Venue:
  • Proceedings of the fourth international workshop on High-level parallel programming and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present BSP-Why, a tool for verifying BSP programs. It is intended to be used as an intermediate core-language for verification tools (mainly condition generators) of BSP extensions of realistic programming languages such as C, JAVA, etc. BSP-Why is based on a sequential simulation of the BSP programs which allows to generate pure sequential codes for the back-end condition generator Why and thus benefit of its large range of existing provers - proof assistants or automatic decision procedures. In this manner, BSP-Why is able to generate proof obligations for BSP programs.