Keeping P4 switches fast and fault-free through automatic verification

Lukács, Dániel and Pongrácz, Gergely and Tejfel, Máté: Keeping P4 switches fast and fault-free through automatic verification. Conference of PhD Students in Computer Science, (11). pp. 52-55. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_065-068.pdf

Download (273kB)

Abstract

The SDN dataplane is going through a paradigm shift, as softwarization of switches sees an increased pull from the market. Yet, software tooling to support development with these new technologies is still in its infancy. In this work, we introduce a framework for verifying data plane protocols defined in the P4 language. Using symbolic execution, the framework checks crash-freedom and bounded execution properties of P4 protocols, and verifies performance requirements by estimating lower and upper bounds of packet processing time. This paper explains related terminology, and briefly describes the methodologies used to reach this goal.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 52-55
Uncontrolled Keywords: Számítástechnika - előadáskivonat, Programozás - előadáskivonat
Additional Information: Bibliogr.: 55. p. ; összefoglalás angol nyelven
Date Deposited: 2019. Oct. 28. 11:49
Last Modified: 2019. Oct. 28. 11:49
URI: http://acta.bibl.u-szeged.hu/id/eprint/61763

Actions (login required)

View Item View Item