Synthesizing Formal Network Specifications From Input-Output Examples
Authors:
- 29 September 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 31 (3) , 994-1009
Abstract
We propose, a tool that synthesizes network specifications in a declarative logic programming language from input-output examples. aims to accelerate the adoption of formal verification in networking practice, by reducing the effort and expertise required to specify network models or properties. aims to be i) highly expressive, capable of synthesizing network specifications with complex semantics; ii) scalable, by virtue of using a novel best-first search algorithm to efficiently explore an unbounded solution space, and iii) robust, avoiding the need for exhaustive input-output examples by actively generating new examples. Our experiments demonstrate that can synthesize a wide range of specifications used in network verification, analysis, and implementations. Furthermore, improves upon existing approaches in terms of expressiveness, robustness to examples, and the quality of synthesized programs.Keywords
Funding Information
- NSF (CCF-2107429, CCF-2107261, CCF-2124431, CNS-2104882, CNS-2107147)
This publication has 24 references indexed in Scilit:
- Automated Network Repair with Meta Provenance2015
- Checking Cloud Contracts in Microsoft Azure2015
- VeriCon2014
- A Program Logic for Verifying Secure Routing Protocols2014
- FreneticACM SIGPLAN Notices, 2011
- I do declareACM SIGOPS Operating Systems Review, 2010
- Declarative networkingCommunications of the ACM, 2009
- The design and implementation of a declarative sensor network system2007
- Inductive Logic Programming: Theory and methodsThe Journal of Logic Programming, 1994
- Query by committee1992