Seminar/2021-03-31

From LRDE

Revision as of 12:28, 15 March 2021 by Bot (talk | contribs) (Created page with "{{SeminarHeader | id = 2021-03-31 | date = Mercredi 31 mars 2021 | schedule = 11h - 12h | location = Https://meet.jit.si/SeminaireLRDE \& Amphi 4 }} {{Talk | id = 2021-...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Mercredi 31 mars 2021, 11h - 12h, Https://meet.jit.si/SeminaireLRDE \& Amphi 4


Contributions to Boolean satisfiability solving and its application to the analysis of discrete systems

Souheib Baarir, Université Paris VI

Despite its NP-completeness, propositional Boolean satisfiability (SAT) covers a broad spectrum of applications. Nowadays, it is an active research area finding its applications in many contexts like planning decision, cryptology, computational biology, hardware and software analysis. Hence, the development of approaches allowing to handle increasingly challenging SAT problems has become a major focus: during the past eight years, SAT solving has been the main subject of my research work. This talk presents some of the main results we obtained in the field.

Souheib Baarir est Docteur en informatique de l'Université de Paris VI depuis 2007 et a obtenu son HDR à Sorbonne Université en 2019. Le thème de ses recherches s'inscrit dans le cadre des méthodes formelles de vérification des systèmes concurrents. En particulier, il s’intéresse aux méthodes permettant d’optimiser la vérification en exploitant le parallélisme et/ou les propriétés de symétries apparaissant dans de tels systèmes.

https://www.lip6.fr/actualite/personnes-fiche.php?ident=P617