Departmental Papers (CIS)
Date of this Version
8-2009
Document Type
Working Paper
Recommended Citation
Anduo Wang, Boon Thau Loo, Changbin Liu, Oleg Sokolsky, and Prithwish Basu, "A Theorem Proving Approach Towards Declarative Networking", 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs) - Emerging Trends . August 2009.
Abstract
We present the DRIVER system for designing, analyzing and implementing network protocols. DRIVER leverages declarative networking, a recent innovation that enables network protocols to be concisely specified and implemented using declarative languages. DRIVER takes as input declarative networking specifications written in the Network Datalog (NDlog) query language, and maps that automatically into logical specifications that can be directly used in existing theorem provers to validate protocol correctness. As an alternative approach, network designer can supply a component-based model of their routing design, automatically generate PVS specifications for verification and subsequent compilation into veriffied declarative network implementations. We demonstrate the use of DRIVER for synthesizing and verifying a variety of well-known network routing protocols.
Subject Area
CPS Formal Methods
Publication Source
22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs) - Emerging Trends
Date Posted: 15 January 2013
This document has been peer reviewed.
Comments
22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs) - Emerging Trends, Munich, Germany, August 17-20.