Laboratoire Spécification et Vérification
Founded in 1997, the Laboratoire Spécification et Vérification (LSV) is the Computer Science laboratory of ENS de Cachan, and is also affiliated to the French Centre National de la Recherche Scientifique (CNRS) as UMR 8643. Research at LSV is focused on the verification of critical software and systems, as well as on the verification of computer system security.
Highlights
CONCUR 2018 Best Paper Award
Benedikt Bollig, Marie Fortin, and Paul Gastin received the Best Paper Award at CONCUR 2018 for their paper It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before".
Sylvain Schmitz nominated at Institut Universitaire de France
Sylvain Schmitz has been nominated Junior Member of the Institut Universitaire de France. During his five-year membership term, he will pursue a project on the verification of resource-centric systems.
News
PhD Defense: Engel Lefaucheux
Visit website for this news | Export event in iCalendar format
- Controlling information in probabilistic systems
- Monday, 24 September 2018 at 2:30pm
- Salle Métivier, IRISA Rennes
PhD Defense: Nathan Grosshans
Visit website for this news | Export event in iCalendar format
- The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids
- Tuesday, 25 September 2018 at 3:00pm
- Pavillon des Jardins, ENS Paris-Saclay
PhD Defense: Antoine Dallon
Visit website for this news | Export event in iCalendar format
- Verification of indistinguishability properties in cryptographic protocols -- Small attacks and efficient decision with SAT-Equiv
- Monday, 26 November 2018 at 2:00pm
- Amphithéâtre Chemla, ENS Paris-Saclay
Alain Finkel and Philippe Schnoebelen receive CAV Award
Alain Finkel and Philippe Schnoebelen receive the 2017 CAV Award, jointly with the Swedish researchers Parosh Abdulla and Bengt Jonsson, for their contributions to the verification of infinite-state systems. The CAV award is given anually at the CAV conference for fundamental contributions to the field of Computer-Aided Verification. Notices of the American Mathematical Society features the award in its January 2018 issue (Notices Amer. Math. Soc. 2018:65(1) Mathematics People, page 50)
Open Positions
There are several open positions for students interested in the research topics investigated at LSV, including the following funded PhD and postdoc openings:
- Reachability in Petri Nets (PhD student)
- Machine learning and verification of infinite-state systems (PhD student)
- Verification of Stack-based Automata (PhD student)
- Multiplayer games over graphs with imperfect monitoring (PhD student)
- Effective concurrent infinite state systems (PhD student)
- Model Checking Well Structured Transition Systems (PhD student)
- Well Structured FIFO Automata (PhD student)
Recent publications
Visit the corresponding web page Register to the RSS feed of LSV publications
| • | . 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 ) |
