Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 1714
Conférences

le (1h4m32s)

CoNeCo: Concurrency, Networks and Coinduction

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 ...
Voir la vidéo
Conférences

le (1h8m54s)

Theoretical Foundations for Runtime Monitoring

Runtime monitoring/verification is a lightweight technique that complements other verification methods in a multi-pronged approach towards ensuring software correctness. The technique poses novel questions to software engineers: it is not easy to see which specifications are amenable to runtime monitoring, and it is not clear which monitors perform the required runtime analysis correctly. In this talk, I will present a theoretical framework that can be used to provide answers to those questions. I will view monitorability as a spectrum: the fewer monitor guarantees are required, the more properties become monitorable. I will then present a monitorability hierarchy ...
Voir la vidéo

 
FMSH
 
Facebook Twitter Google+
Mon Compte