Name
Abstract | ||
|---|---|---|
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally applicable, because it does not require a preprocessing step to eliminate 驴-loops. We prove soundness of our approach and present a set of rules to prove the reachability of focus points. Our method has been formalized and proved correct using PVS. Thus we have established a framework for mechanical protocol verification. We apply this framework to the Concurrent Alternating Bit Protocol. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10703-006-0004-3 | Formal Methods in System Design |
Keywords | Field | DocType |
Protocol verification,Branching bisimulation,Process algebra,PVS | Focus (geometry),Computer science,Alternating bit protocol,Algorithm,Theoretical computer science,Reachability,Preprocessor,Soundness,Protocol verification,Process calculus,Branching (version control) | Journal |
Volume | Issue | ISSN |
29 | 1 | 0925-9856 |
Citations | PageRank | References |
8 | 0.51 | 35 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wan Fokkink | 1 | 1089 | 88.64 |
| Jun Pang | 2 | 521 | 30.59 |
| Jaco Van De Pol | 3 | 1022 | 78.19 |