Declarative Network Verification

  • Authors:

  • Anduo Wang;Prithwish Basu;Boon Thau Loo;Oleg Sokolsky

  • Affiliations:

  • Computer and Information Sciences Department, University of Pennsylvania PA 19104-6389;Network Research Group, BBN Technologies, Cambridge MA 02138;Computer and Information Sciences Department, University of Pennsylvania PA 19104-6389;Computer and Information Sciences Department, University of Pennsylvania PA 19104-6389

  • Venue:
  • PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present our initial design and implementation of a declarative network verifier (DNV ). DNV utilizes theorem proving , a well established verification technique where logic-based axioms that automatically capture network semantics are generated, and a user-driven proof process is used to establish network correctness properties. DNV takes as input declarative networking specifications written in the Network Datalog (NDlog ) query language, and maps that automatically into logical axioms that can be directly used in existing theorem provers to validate protocol correctness. DNV is a significant improvement compared to existing use case of theorem proving which typically require several man-months to construct the system specifications. Moreover, NDlog , a high-level specification, whose semantics are precisely compiled into DNV without loss, can be directly executed as implementations, hence bridging specifications, verification, and implementation. To validate the use of DNV , we present case studies using DNV in conjunction with the PVS theorem prover to verify routing protocols, including eventual properties of protocols in dynamic settings.