Date of this Version
Anduo Wang, Prithwish Basu, Boon Thau Loo, and Oleg Sokolsky, "Declarative Network Verification", Lecture Notes in Computer Science: Practical Aspects of Declarative Languages 5418, 61-75. December 2008. http://dx.doi.org/10.1007/978-3-540-92995-6_5
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.
CPS Formal Methods
Lecture Notes in Computer Science: Practical Aspects of Declarative Languages
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-92995-6_5
declarative networking, network protocol verification, domain-specific languages, theorem proving
Date Posted: 16 January 2009
This document has been peer reviewed.