jeudi 29 mars, 14h en salle Minquiers
Philippe Schnoebelen (CNRS & ENS Paris-Saclay)
Decidable fragments of the logic of subwords
While subwords appear prominently in many works in language theory, program verification, combinatorics on words, etc., not much is known about the decidability of logics for subwords and subsequences. In this talk we present several recently identified fragments of the first-order logic of subwords that have been shown decidable. We also describe some new techniques from the descriptive complexity of piecewise-testable languages that have been used in the complexity analysis of our decidable logic fragments.
Exposés des semaines suivantes
jeudi 5 avril, 14h en salle Sardaigne (F102)
The ATSyRA tool: an environment for the assisted design and analysis of Attack Trees
I will present the formal setting we develop to support the functionalities of the tool ATSyRA (some of them are under development).
In a nutshell, the tool allows experts to:
- specify a system (currently a building);
- specify an attack goal, and more generally an attack tree;
- verify properties of a tree w.r.t. the system;
- ask for many kinds of witnesses regarding attacks.
This project is supported by DGA Bruz. It involves members of IRISA from several teams, Yann Thierry-Mieg from LIP6 and the end-user Lionel van Aertryck from DGA Bruz.
mardi 10 avril, 10h
Belief functions applied to crowdsourcing
The goal of information fusion is to combine information coming from several sources. In this context that is important to model the data and the sources in order to take decision in the most sure and precise way. The main approaches of information fusion will be presented, we will focus on the theory of belief functions. We will consider a problem of classification where the sources give information on an observation to its belonging to a class. We will give some illustration on crowdsourcing problems.