Asynchronous rendez-vous in distributed logic programming

Eliëns, Anton; Vink, Erik P. de

doi:10.1007/3-540-56596-5_34

Cited by 2 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The types of synchronization constructs permitted in the TTS directly determine the "Petri net class" of M. More precisely, if we only allow standard thread and spawn transitions → and in , system M can be expressed as a (plain) Petri net. If we allow signal/broadcast transitions / → in , then our model coincides in expressiveness with Petri nets with asynchronous rendezvous/transfer transitions, respectively [Ciardo 1994;Eliëns and de Vink 1992], which are strictly more expressive than plain Petri nets [Dufourd et al 1998;Finkel et al 2006]. We omit proofs of these equivalences in this article, as they are mostly straightforward.…”

Section: From Programs To Tts and Infinite-state Transition Systemsmentioning

confidence: 98%

A Widening Approach to Multithreaded Program Verification

Kaiser

Kroening

Wahl

2014

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Pthread-style multithreaded programs feature rich thread communication mechanisms, such as shared variables, signals, and broadcasts. In this article, we consider the automated verification of such programs where an unknown number of threads execute a given finite-data procedure in parallel. Such procedures are typically obtained as predicate abstractions of recursion-free source code written in C or Java. Many safety problems over finite-data replicated multithreaded programs are decidable via a reduction to the coverability problem in certain types of well-ordered infinite-state transition systems. On the other hand, in full generality, this problem is Ackermann-hard, which seems to rule out efficient algorithmic treatment. We present a novel, sound, and complete yet empirically efficient solution. Our approach is to judiciously widen the original set of coverability targets by configurations that involve fewer threads and are thus easier to decide, and whose exploration may well be sufficient: if they turn out uncoverable, so are the original targets. To soften the impact of "bad guesses"-configurations that turn out coverable-the exploration is accompanied by a parallel engine that generates coverable configurations; none of these is ever selected for widening. Its job being merely to prevent bad widening choices, such an engine need not be complete for coverability analysis, which enables a range of existing partial (e.g., nonterminating) techniques. We present extensive experiments on multithreaded C programs, including device driver code from FreeBSD, Solaris, and Linux distributions. Our approach outperforms existing coverability methods by orders of magnitude.

show abstract