Cones and Foci for Protocol Verification Revisited

Abstract

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 [22], our method is more generally applicable, and does not require a preprocessing step to eliminate τ -loops. We prove soundness of our approach and give an application.

Verifying a Sliding Window Protocol in μCRL

“…• The cones and foci method from [13,23] [13] for the technical details of the cones and foci technique.…”

“…By the cones and foci method we obtain the following matching criteria (cf. [13]). Trivial matching criteria are left out.…”

“…Another bug in the µCRL specification of the SWP was detected by means of a model checking analysis. A first attempt to prove the resulting SWP correct led to the verification of a bakery protocol [18], and to the development of the cones and foci proof method [23,13]. This method plays an essential role in the proof in the current paper, and has been used to prove many other protocols and distributed algorithms correct.…”

“…We prove that N nonmod is branching bisimilar to the FIFO queue Z of size 2n (see Section 4.2), using the cones and foci method [13].…”

Cones and foci: A mechanical framework for protocol verification

“…An earlier version of this paper (lacking the formalization in PVS and the methodology for reachability analysis) appeared as [15].…”