Synchronization Synthesis for Network Programs

McClurg, Jedidiah; Hojjat, Hossein; Černý, Pavol

doi:10.1007/978-3-319-63390-9_16

“…It also automatically verifies the correctness of control programs based on user-provided temporal properties. In addition to verification, synthesis techniques [McClurg et al 2017[McClurg et al , 2015Padon et al 2015] have also been proposed to aid softwaredefined networking. For instance, McClurg et al [McClurg et al 2017 proposes synthesis techniques for updating global configurations and generating synchronizations for distributed controllers.…”

Section: Related Workmentioning

confidence: 99%

“…In addition to verification, synthesis techniques [McClurg et al 2017[McClurg et al , 2015Padon et al 2015] have also been proposed to aid softwaredefined networking. For instance, McClurg et al [McClurg et al 2017 proposes synthesis techniques for updating global configurations and generating synchronizations for distributed controllers. Padon et al [Padon et al 2015] formalizes the correctness and optimality requirements of decentralizing network policies and identifies a class that is amenable to synthesis of optimal rule installation policies.…”

Section: Related Workmentioning

confidence: 99%

“…To help developers with programming of SDN, several synthesis and repair techniques are proposed in recent years. For instance, McClurg et al [McClurg et al 2017 have developed synthesis techniques for automatically updating global configurations and generating synchronizations for distributed controllers from high-level specifications. In addition, prior work [Hojjat et al 2016;Wu et al 2015Wu et al , 2017 presents automated repair technique for fixing network policies written in declarative domain-specific languages such as Datalog and horn clauses.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

NetRep: Automatic Repair for Network Programs

Shi¹,

Wang²,

Alur³

et al. 2021

Preprint

0

View full text Add to dashboard Cite

Debugging imperative network programs is a challenging task for developers because understanding various network modules and complicated data structures is typically time-consuming. To address the challenge, this paper presents an automated technique for repairing network programs from unit tests. Specifically, given as input a faulty network program and a set of unit tests, our approach localizes the fault through symbolic reasoning, and synthesizes a patch such that the repaired program can pass all unit tests. It applies domain-specific abstraction to simplify network data structures and utilizes modular analysis to facilitate function summary reuse for symbolic analysis. We implement the proposed techniques in a tool called NetRep and evaluate it on 10 benchmarks adapted from real-world software-defined networking controllers. The evaluation results demonstrate the effectiveness and efficiency of NetRep for repairing network program.

show abstract

“…Both explicit and SMT-based model checking [1,5,22,23,26,31] is used to verify software-defined networks. Closest to our approach are models of networks as Kripke structures to use model checking for synthesis of correct network updates [8,24]. The model checking subroutine of the synthesizer assumes that each packet sees at most one updated switch.…”

Section: Related Workmentioning

confidence: 99%

AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL

Finkbeiner

¹

,

Gieseking

²

,

Hecking-Harbusch

³

et al. 2020

Computer Aided Verification

View full text Add to dashboard Cite

The correctness of networks is often described in terms of the individual data flow of components instead of their global behavior. In software-defined networks, it is far more convenient to specify the correct behavior of packets than the global behavior of the entire network. Petri nets with transits extend Petri nets and Flow-LTL extends LTL such that the data flows of tokens can be tracked. We present the tool AdamMC as the first model checker for Petri nets with transits against Flow-LTL. We describe how AdamMC can automatically encode concurrent updates of software-defined networks as Petri nets with transits and how common network specifications can be expressed in Flow-LTL. Underlying AdamMC is a reduction to a circuit model checking problem. We introduce a new reduction method that results in tremendous performance improvements compared to a previous prototype. Thereby, AdamMC can handle software-defined networks with up to 82 switches.

show abstract

“…Both explicit and SMT-based model checking [5,23,22,31,1,26] is used to verify software-defined networks. Closest to our approach are models of networks as Kripke structures to use model checking for synthesis of correct network updates [8,24]. The model checking subroutine of the synthesizer assumes that each packet sees at most one updated switch.…”

Section: Related Workmentioning

confidence: 99%

AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL (Full Version)

Finkbeiner,

Gieseking,

Hecking-Harbusch

et al. 2020

Preprint

0

View full text Add to dashboard Cite

The correctness of networks is often described in terms of the individual data flow of components instead of their global behavior. In software-defined networks, it is far more convenient to specify the correct behavior of packets than the global behavior of the entire network. Petri nets with transits extend Petri nets and Flow-LTL extends LTL such that the data flows of tokens can be tracked. We present the tool AdamMC as the first model checker for Petri nets with transits against Flow-LTL. We describe how AdamMC can automatically encode concurrent updates of software-defined networks as Petri nets with transits and how common network specifications can be expressed in Flow-LTL. Underlying AdamMC is a reduction to a circuit model checking problem. We introduce a new reduction method that results in tremendous performance improvements compared to a previous prototype. Thereby, AdamMC can handle software-defined networks with up to 82 switches. ‡ This is the full version of [13].

show abstract

Synchronization Synthesis for Network Programs

Cited by 11 publications

References 31 publications

NetRep: Automatic Repair for Network Programs

NetRep: Automatic Repair for Network Programs

AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL

AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL (Full Version)

Contact Info

Product

Resources

About