2008 Seventh IEEE International Symposium on Network Computing and Applications On the Application of Formal Methods for Specifying and Verifying Distributed Protocols July 10-July 12 ISBN: 978-0-7695-3192-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2008.24
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relativecapabilities, strengths and usability.To the best of our knowledge, this is the first hands-on evaluation of the two models,??and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies in specifying and verifying (distributed) protocols.
Index Terms:
Formal Methods, I/O Automata, Process Algebra, Distributed Protocols, Applicability, Usability,
Citation:
Marina Gelastou, Chryssis Georgiou, Anna Philippou, "On the Application of Formal Methods for Specifying and Verifying Distributed Protocols," nca, pp.195-204, 2008 Seventh IEEE International Symposium on Network Computing and Applications, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||