Research at LSV focuses on the verification of computerized systems, of databases and of security protocols. LSV develops the mathematical and algorithmic foundations to the development of tools for automatically proving correctness and detecting flaws.
Internship and PhD proposals are regularly posted by LSV researchers on our themes.
the scientific report for the 5-year contract 2014--2018 [in French]
|•||. Most Permissive Semantics of Boolean Networks. Research Report 1808.10240, Computing Research Repository, August 2018. 15 pages. ( Web page | PDF | BibTeX )|
|•||. Symbolic Proofs for Lattice-Based Cryptography. In CCS'18. ACM Press, October 2018. To appear. ( BibTeX )|
|•||. Decidable XPath Fragments in the Real World, Preprint, 2018. ( Web page | BibTeX )|
|•||. A Hypersequent Calculus with Clusters for Tense Logic over Ordinals, Preprint, 2018. ( Web page | BibTeX )|
|•||. Fast Multidimensional Asymptotic and Approximate Consensus. In DISC'18, Leibniz International Proceedings in Informatics, pages 27:1-27:15. Leibniz-Zentrum für Informatik, October 2018. ( Web page | PDF (long version) | BibTeX )|