Formally Verifiable Networking

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Formal Methods
Funder
Grant number
License
Copyright date
Distributor
Related resources
Contributor
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.

Advisor
Date of presentation
2009-10-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T07:38:56.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
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
Recommended citation
Collection