2013 IEEE International Conference on Communications (ICC) 2013
DOI: 10.1109/icc.2013.6654813
|View full text |Cite
|
Sign up to set email alerts
|

Model checking invariant security properties in OpenFlow

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
71
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 129 publications
(74 citation statements)
references
References 6 publications
0
71
0
1
Order By: Relevance
“…Also, Qazi et al [84] present a policy security monitoring layer for efficient middlebox-specific traffic steering. Another work that goes in this direction is proposed by Son et al [85].…”
Section: Securitymentioning
confidence: 95%
“…Also, Qazi et al [84] present a policy security monitoring layer for efficient middlebox-specific traffic steering. Another work that goes in this direction is proposed by Son et al [85].…”
Section: Securitymentioning
confidence: 95%
“…These solutions provide tools that generally translate a data plane configuration to a model, upon which different techniques are used to prove that it satisfies a set of properties related to a given network policy. Examples of this approach include (MAI et al, 2011), (SON et al, 2013, (LOPES et al, 2015), and (LOPES et al, 2016). Different types of properties can be proved depending on the verification tool.…”
Section: Data Plane Verificationmentioning
confidence: 99%
“…Model checking is the process of modeling the system and its properties, and checking if the properties are valid in all states of the model. Thus, the advantage of symbolic execution over model-checking is performance: symbolic engines use SMT solvers to make path reachability decisions only, while modelchecking based approaches encode both network models and their properties into the solvers (e.g., as in (SON et al, 2013;LOPES et al, 2016)). However, symbolic execution faces the path explosion problem, arising from the exponential nature of traversing all paths of an execution tree.…”
Section: Symbolic Executionmentioning
confidence: 99%
See 1 more Smart Citation
“…More closely related works to these specific aspects are discussed in the context of the corresponding chapters, where the contributions and technical details of this thesis are presented. [113] Flow rules checker Use prefix tree( an ordered tree data structure) FLOVER [114] Flow rules checker Utilise the satisfiability modulo theories Assertion [115] SDN application debugger…”
Section: Security Of the Southbound Interfacementioning
confidence: 99%