Mon compte

Résultats de recherche

Nombre de programmes trouvés : 270

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

le (41m54s)

Amis de l'Instruction : émancipez-vous, lisez !

avec Michel Blanc, maître de conférences honoraire Université Paris-X Nanterre, Secrétaire général de la Bibliothèque des amis de l'Instruction (BAI).Voir, en complément, le site internet de la BAI et sa très riche audiothèque (podcasts) de conférences régulièrement organisées à la bibliothèque — qui poursuit ainsi depuis 1860 son rôle originel d'instruction et de diffusion de la connaissance :
Voir la vidéo

le (50m47s)

Strict monotonicity of percolation thresholds under covering maps (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)

Percolation is a model for propagation in porous media that as introduced in  1957 by Broadbent and Hammersley. An infinite graph G models the geometry of the situation and a parameter p embodies its porosity: percolation consists in keeping independently each edge with probability p, erasing it otherwise, and looking at the infinite connected components of the resulting graph. It turns out that there is a critical porosity: for smaller porosities, all components are finite almost surely, while for larger ones, there is almost surely at ...
Voir la vidéo

le (42m40s)

Stein-Malliavin method for discrete alpha stable point processes (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)

The notion of discrete alpha-stable point processes generalizes to point processes the notion of stable distribution. It has been introduced and studied by Davydov, Molchanov and Zuyev a few years ago. Their stability property leaves a large degree of variability in the choice of their driving characteristics but enforces a rich mathematical structure. We show how to build a Dirichlet-Malliavin structure for these processes and we apply this framework to several limit theorems. Some known results for Poisson point processes appear as corollaries of ...
Voir la vidéo

Facebook Twitter Google+
Mon Compte