Abstract

Many industrial applications, including safety-critical ones, consist of several dis- joint components that use message passing to communicate according to some protocol. These components are typically highly concurrent, since message ex- changes may occur in any order. Developing correct message passing programs is therefore very challenging, which makes proving their correctness crucial [4]. A popular API for implementing message passing programs is the Message Passing Interface (MPI) library. We focus on the modular veri�cation of MPI programs. Related work mainly focuses on communication and considers abstract models rather than concrete implementations [10,5]. We consider concrete Java code and combine static veri�cation with well-known techniques for reasoning about concurrent and distributed programs, based on process algebras [7].
Original languageUndefined
Number of pages2
StatePublished - Mar 2016

Fingerprint

Message passing
Positive ions
Application programming interfaces (API)
Algebra
Industrial applications
Communication

Keywords

  • IR-104115
  • EWI-27674

Cite this

@misc{8ef361ba9cb749f68e513804db197549,
title = "Static Verification of Message Passing Programs",
abstract = "Many industrial applications, including safety-critical ones, consist of several dis- joint components that use message passing to communicate according to some protocol. These components are typically highly concurrent, since message ex- changes may occur in any order. Developing correct message passing programs is therefore very challenging, which makes proving their correctness crucial [4]. A popular API for implementing message passing programs is the Message Passing Interface (MPI) library. We focus on the modular veri�cation of MPI programs. Related work mainly focuses on communication and considers abstract models rather than concrete implementations [10,5]. We consider concrete Java code and combine static veri�cation with well-known techniques for reasoning about concurrent and distributed programs, based on process algebras [7].",
keywords = "IR-104115, EWI-27674",
author = "Oortwijn, {Wytse Hendrikus Marinus} and Stefan Blom and Marieke Huisman",
note = "extended abstract for ICT.Open",
year = "2016",
month = "3",

}

TY - CONF

T1 - Static Verification of Message Passing Programs

AU - Oortwijn,Wytse Hendrikus Marinus

AU - Blom,Stefan

AU - Huisman,Marieke

N1 - extended abstract for ICT.Open

PY - 2016/3

Y1 - 2016/3

N2 - Many industrial applications, including safety-critical ones, consist of several dis- joint components that use message passing to communicate according to some protocol. These components are typically highly concurrent, since message ex- changes may occur in any order. Developing correct message passing programs is therefore very challenging, which makes proving their correctness crucial [4]. A popular API for implementing message passing programs is the Message Passing Interface (MPI) library. We focus on the modular veri�cation of MPI programs. Related work mainly focuses on communication and considers abstract models rather than concrete implementations [10,5]. We consider concrete Java code and combine static veri�cation with well-known techniques for reasoning about concurrent and distributed programs, based on process algebras [7].

AB - Many industrial applications, including safety-critical ones, consist of several dis- joint components that use message passing to communicate according to some protocol. These components are typically highly concurrent, since message ex- changes may occur in any order. Developing correct message passing programs is therefore very challenging, which makes proving their correctness crucial [4]. A popular API for implementing message passing programs is the Message Passing Interface (MPI) library. We focus on the modular veri�cation of MPI programs. Related work mainly focuses on communication and considers abstract models rather than concrete implementations [10,5]. We consider concrete Java code and combine static veri�cation with well-known techniques for reasoning about concurrent and distributed programs, based on process algebras [7].

KW - IR-104115

KW - EWI-27674

M3 - Paper

ER -