Name
Abstract | ||
|---|---|---|
Concurrent systems are intrinsically complex and their verification is hampered by the well-known "state-space explosion" issue. Compositional verification is a powerful approach, based on the divide-and-conquer paradigm, to address this issue. Despite impressive results, this approach is not used widely enough in practice, probably because it exists under multiple variants that make knowledge of the field hard to attain. In this article, we highlight the seminal results of Graf & Steffen and propose a survey of compositional verification techniques that exploit (or not) these results. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-00244-2_13 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Formal equivalence checking,Model checking,Computer science,Theoretical computer science,Exploit,Bisimulation,Formal methods,Process calculus | Conference | 11119 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.38 |
References | Authors | |
38 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hubert Garavel | 1 | 1194 | 84.45 |
| Frédéric Lang | 2 | 354 | 17.87 |
| Laurent Mounier | 3 | 1187 | 79.54 |