Conférence

CoNeCo: Concurrency, Networks and Coinduction

Réalisation : 16 mai 2019 Mise en ligne : 16 mai 2019
  • document 1 document 2 document 3
  • niveau 1 niveau 2 niveau 3
  • audio 1 audio 2 audio 3
Descriptif

In recent years, concurrent Kleene algebra (CKA), an extension of Kleene Algebra (KA) that includes concurrent composition as a first-class citizen, has been proposed by Hoare et al. as a setting to study the algebraic properties of concurrent composition as an operator on programs.  Orthogonally, based on KA, Foster et al proposed NetKAT, a domain-specific language that can be used to program and verify policies of Software Defined Networks. in this talk, we will show how to develop a concurrent extension of NetKAT based on CKA, which supports expressing and verifying the concurrent filtering of packets — on the same network device, or possibly also distributed among different devices. This extension enables automated algebraic verification of properties that are relevant for (concurrent) packet processing in networks. This is joint work with Tobias Kappe and others, carried within the CoNeCo project (for more info, see the CoNeCo website).

Intervenants
Thèmes
Notice
Lieu de réalisation
Inria Sophia Antipolis
Langue :
Anglais
Crédits
CNRS - Centre National de la Recherche Scientifique (Publication), INRIA (Institut national de recherche en informatique et automatique) (Production), INRIA (Institut national de recherche en informatique et automatique) (Publication), UNS (Publication)
Conditions d'utilisation
Droit commun de la propriété intellectuelle
Citer cette ressource:
Inria. (2019, 16 mai). CoNeCo: Concurrency, Networks and Coinduction. [Vidéo]. Canal-U. https://www.canal-u.tv/99467. (Consultée le 20 mai 2022)
Contacter
Documentation


Sur le même thème