Loïg Jezequel

École Centrale de Nantes — France

Computer Science · Physical Sciences

8h-index249citations37works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Formal Methods in Verification(22), Logic, Reasoning, and Knowledge(10), Petri Nets in System Modeling(10), Software Testing and Debugging Techniques(8), Distributed systems and fault tolerance(7)

Publications37 total

On-line Instruction Flow Obfuscation: Formal Proof and Proposal for Implementation on CVA6
SPIRE - Sciences Po Institutional REpository·2025Open Access
Behind the Scene of the Model Checking Contest, Analysis of Results from 2018 to 2023
Lecture notes in computer science·2024· 1 citedOpen Access
Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019
International Journal on Software Tools for Technology Transfer·2021· 8 citedOpen Access
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs
Lecture notes in computer science·2021· 1 citedOpen Access
A Lazy Query Scheme for Reachability Analysis in Petri Nets
Lecture notes in computer science·2021Open Access
Pomset bisimulation and unfolding for reset Petri nets
Information and Computation·2020· 3 citedOpen Access
Distributed computation of vector clocks in Petri net unfoldings for test selection
Discrete Event Dynamic Systems·2020· 1 cited
Presentation of the 9th Edition of the Model Checking Contest
Lecture notes in computer science·2019· 32 citedOpen Access
Pomsets and Unfolding of Reset Petri Nets
Lecture notes in computer science·2018· 1 cited
Distributed computation of vector clocks in Petri nets unfolding for test selection
IFAC-PapersOnLine·2018· 5 citedOpen Access
MCC’2017 – The Seventh Model Checking Contest
Lecture notes in computer science·2018· 22 citedOpen Access
Let's Be Lazy, We Have Time or, Lazy Reachability Analysis for Timed Automata
SPIRE - Sciences Po Institutional REpository·2017· 1 cited
Let’s Be Lazy, We Have Time
Lecture notes in computer science·2017· 1 cited
Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters
Electronic Proceedings in Theoretical Computer Science·2016· 3 citedOpen Access
Lazy Reachability Analysis in Distributed Systems
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2016· 7 citedOpen Access
MCC’2015 – The Fifth Model Checking Contest
Lecture notes in computer science·2016· 25 citedOpen Access
Factored Cost-Optimal Planning Using Message Passing Algorithms
Fundamenta Informaticae·2015· 1 cited
Factored Planning
ACM Transactions on Embedded Computing Systems·2015· 3 cited
Message-Passing Algorithms for the Verification of Distributed Protocols
HAL (Le Centre pour la Communication Scientifique Directe)·2014Open Access
Message-Passing Algorithms for the Verification of Distributed Protocols
Lecture notes in computer science·2014
page 1 of 2Next →

Frequent Co-authors

Éric Fabre(13), Stefan Schwoon(6), Francis Hulin-Hubard(5), Emmanuel Paviot-Adet(5), Thomas Chatain(5), Didier Lime(5), Lom Messan Hillah(4), Fabrice Kordon(4), Jiřı́ Srba(4), Elvio Gilberto Amparore(3), Bernard Berthomieu(3), Peter Gjøl Jensen(3), Yann Thierry-Mieg(3), Karsten Wolf(3), Stefan Haar(3), Victor Khomenko(3), Javier Esparza(3), Patrik Haslum(2), Sylvie Thiébaux(2), Silvano Dal Zilio(2)