Axiom-based property verification for P4 programs

Tóth Gabriella; Tejfel Máté: Axiom-based property verification for P4 programs.

[thumbnail of cscs_2018_093-096.pdf]
Előnézet
Cikk, tanulmány, mű
cscs_2018_093-096.pdf

Letöltés (206kB) | Előnézet

Absztrakt (kivonat)

We produce an axiom-based program properties verification method for P4 programs. P4 is a special, domain specific, declarative programming language to develop network packet forwarding. P4 is quite new, and different from general-purpose programming languages so it is an important idea to understand its behavior and to verify it. The operational semantics of P4 is reachable in K framework, so there is an opportunity to do its verification based on its operational semantics, but it is a low level solution, therefore the proof of complex properties can be too difficult and costly. So we would like to verify the program in a higher abstraction level, in which we would introduce axioms, which are correct in the operational semantics. Using these axioms we can create easier and more transparent proof.

Mű típusa: Konferencia vagy workshop anyag
Befoglaló folyóirat/kiadvány címe: Conference of PhD Students in Computer Science
Dátum: 2018
Kötet: 11
Oldalak: pp. 80-83
Konferencia neve: Conference of PhD students in computer science (11.) (2018) (Szeged)
Befoglaló mű URL: http://acta.bibl.u-szeged.hu/59477/
Kulcsszavak: P4 - programozási nyelv, Programozás, Számítástechnika
Megjegyzések: Bibliogr.: 83. p. ; összefoglalás angol nyelven
Feltöltés dátuma: 2019. nov. 04. 09:43
Utolsó módosítás: 2022. nov. 08. 10:18
URI: http://acta.bibl.u-szeged.hu/id/eprint/61771
Bővebben:
Tétel nézet Tétel nézet