On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony - Archive ouverte HAL Access content directly
Book Sections Year : 2018

On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony

Abstract

We address the problem of verifying message passing programs , defined as a set of processes communicating through unbounded FIFO buffers. We introduce a bounded analysis that explores a special type of computations, called k-synchronous. These computations can be viewed as (unbounded) sequences of interaction phases, each phase allowing at most k send actions (by different processes), followed by a sequence of receives corresponding to sends in the same phase. We give a procedure for deciding k-synchronizability of a program, i.e., whether every computation is equivalent (has the same happens-before relation) to one of its k-synchronous computations. We show that reachability over k-synchronous computations and checking k-synchronizability are both PSPACE-complete.
Fichier principal
Vignette du fichier
main.pdf (583.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01947855 , version 1 (07-12-2018)

Identifiers

  • HAL Id : hal-01947855 , version 1

Cite

Ahmed Bouajjani, Constantin Enea, Kailiang Ji, Shaz Qadeer. On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony. International Conference on Computer Aided Verification, CAV 2018: Computer Aided Verification, Springer International Publishing, pp.372-391, 2018. ⟨hal-01947855⟩
62 View
56 Download

Share

Gmail Facebook X LinkedIn More