Departmental Papers (CIS)
Date of this Version
10-2009
Document Type
Conference Paper
Recommended Citation
Anduo Wang, Limin Jia, Changbin Liu, Boon Thau Loo, Oleg Sokolsky, and Prithwish Basu, "Formally Verifiable Networking", 8th ACM Workshop on Hot Topics in Networks . October 2009.
Abstract
This paper proposes Formally Verifiable Networking (FVN), a novel approach towards unifying the design, specification, implementation, and verification of networking protocols within a logic-based framework. In FVN, formal logical statements are used to specify the behavior and the properties of the protocol. FVN uses declarative networking as an intermediary layer between high-level logical specifications of the network model and low-level implementations. A theorem prover is used to statically verify the properties of declarative network protocols. Moreover, a property preserving translation exists for generating declarative networking implementations from verified formal specifications. We further demonstrate the possibility of designing and specifying well-behaved network protocols with correctness guarantees in FVN using meta-models in a systematic and compositional way.
Subject Area
CPS Formal Methods
Publication Source
8th ACM Workshop on Hot Topics in Networks
Date Posted: 15 January 2013
This document has been peer reviewed.
Comments
8th ACM Workshop on Hot Topics in Networks (HotNets-VIII), New York City, NY, October 22-23. Proceedings website: http://conferences.sigcomm.org/hotnets/2009/program.html