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]
|•||. Decidable XPath Fragments in the Real World. In PODS'19. ACM Press, June 2018. To appear. ( Web page | BibTeX )|
|•||. Efficiently Deciding Equivalence for Standard Primitives and Phases. In ESORICS'18, LNCS 11098, pages 491-511. Springer, September 2018. ( Web page | PDF | PDF (long version) | BibTeX )|
|•||. POR for Security Protocol Equivalences - Beyond Action-Determinism. In ESORICS'18, LNCS 11098, pages 385-405. Springer, September 2018. ( Web page | BibTeX )|
|•||. Connected Choice and Brouwer's Fixed Point Theorem. Journal of Mathematical Logic, 2018. To appear. ( BibTeX )|
|•||. The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods in Computer Science, 2019. To appear. ( Web page | PDF | BibTeX )|