2015
DOI: 10.18255/1818-1015-2013-6-36-51
|View full text |Cite
|
Sign up to set email alerts
|

A Formal Model and Verification Problems for Software Defined Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…VERMONT follows relational‐automatic formal modeling technique specified in Zakharov et al for modeling SDN environment. It defines packet header, switch port, and switch names as a binary vector.…”
Section: Formal Specification and Verification Tools For Sdnmentioning
confidence: 99%
“…VERMONT follows relational‐automatic formal modeling technique specified in Zakharov et al for modeling SDN environment. It defines packet header, switch port, and switch names as a binary vector.…”
Section: Formal Specification and Verification Tools For Sdnmentioning
confidence: 99%
“…Some interesting cases of such type of solutions for new gen eration network technologies, in particular, for pro gram configured networks, are provided by the Open Network Laboratory (Stanford University, United States) [39, 40, etc.]. Another no less interesting instance of this type of effective solutions is mathe matical models, algorithms, and program systems for the formalized verification of program configured networks, which has been developed by the Applied Research Center for Computer Solutions in coopera tion with the Faculty of Computational Mathematics and Cybernetics of the Moscow State University [3,4]. In this instance, the control of the correctness of meeting the set of basic security policy requirements, including the attainability of the point to point state, zero cyclicity, and division of traffic among target sets of apexes in non crossing streams, is formalized first using a specialized problem oriented language of logic of first order predicates (to ensure the expressibility of the transitive closure of binary relations and the for malization of relations of the so called one step attainability for the apexes of the program configured network graph).…”
Section: Some Remarks On the Subject Background And Selection Of Datamentioning
confidence: 99%
“…(ii) reliable 2 handling of very large 3 and minor (sta tistically insignificant) selections of collected empiri cal data;…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations