Name
Abstract | ||
|---|---|---|
Parallel and distributed systems rely on intricate protocols to manage shared resources and synchronize, i.e., to manage how many processes are in a particular state. Effective verification of such systems requires universally quantification to reason about parameterized state and cardinalities tracking sets of processes, messages, failures to adequately capture protocol logic. In this paper we present Tool, an automatic invariant synthesis method that integrates cardinality-based reasoning and universal quantification. The resulting increase of expressiveness allows Tool to verify, for the first time, a representative collection of intricate parameterized protocols. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2908080.2908129 | PLDI |
Keywords | Field | DocType |
Concurrency,verification,parametric systems,cardinalities | Parameterized complexity,Synchronization,Programming language,Computer science,Concurrency,Cardinality,Theoretical computer science,Invariant (mathematics),Universal quantification,Expressivity | Conference |
Volume | Issue | ISSN |
51 | 6 | 0362-1340 |
Citations | PageRank | References |
7 | 0.51 | 40 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus von Gleissenthall | 1 | 21 | 3.47 |
| Nikolaj Bjørner | 2 | 3818 | 181.02 |
| Andrey Rybalchenko | 3 | 1439 | 68.53 |