François Laroussinie

Université Paris Cité — France

Computer Science · Physical Sciences

27h-index2.7kcitations92works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

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

Research Topics

Formal Methods in Verification(75), Logic, programming, and type systems(49), Model-Driven Software Engineering Techniques(28), Software Testing and Debugging Techniques(16), Logic, Reasoning, and Knowledge(15)

Publications92 total

Arbitrary-arity Tree Automata and QCTL
arXiv (Cornell University)·2024Open Access
QLTL Model-Checking
SPIRE - Sciences Po Institutional REpository·2024Open Access
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi mathvariant="sans-serif">QCTL</mml:mi></mml:math> model-checking with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.svg"><mml:mi mathvariant="sans-serif">QBF</mml:mi></mml:math> solvers
Information and Computation·2020
QCTL model-checking with QBF solvers
arXiv (Cornell University)·2020· 1 citedOpen Access
Towards Synthesis of Distributed Algorithms with {SMT} Solvers
HAL (Le Centre pour la Communication Scientifique Directe)·2019
Towards Synthesis of Distributed Algorithms with SMT Solvers
Lecture notes in computer science·2019· 1 cited
From Quantified CTL to QBF
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 1 citedOpen Access
Timed Temporal Logics
Lecture notes in computer science·2017· 10 citedOpen Access
On the Expressiveness of QCTL
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2016· 3 citedOpen Access
ATLsc with partial observation
arXiv (Cornell University)·2015· 2 citedOpen Access
ATLsc with partial observation
Electronic Proceedings in Theoretical Computer Science·2015· 7 citedOpen Access
Augmenting <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="sans-serif">ATL</mml:mi></mml:math> with strategy contexts
Information and Computation·2015· 39 cited
Quantified CTL: Expressiveness and Complexity
Logical Methods in Computer Science·2014· 38 citedOpen Access
Satisfiability of ATL with strategy contexts
Electronic Proceedings in Theoretical Computer Science·2013· 11 citedOpen Access
Counting CTL
Logical Methods in Computer Science·2013· 1 citedOpen Access
Quantified CTL: Expressiveness and Model Checking
Lecture notes in computer science·2012· 17 cited
Concur 2010 - Concurrency Theory
2011· 129 cited
Timed Modal Logics for Real-Time Systems
Journal of Logic Language and Information·2010· 11 cited
Counting LTL
2010· 35 citedOpen Access
Proceedings of the 21st international conference on Concurrency theory
2010· 10 cited
page 1 of 5Next →

Frequent Co-authors

Nicolas Markey(15), Ph. Schnoebelen(11), Patricia Bouyer(7), Kim G. Larsen(5), Béatrice Bérard(4), Philippe Schnoebelen(4), Arnaud Da Costa(3), Luca Aceto(3), Jeremy Sproston(3), Ghassan Oreiby(3), Franck Cassez(3), Michel Bidoit(2), Antoine Petit(2), Laure Petrucci(2), Paul Gastin(2), Carsten Weise(2), Thomas Brihaye(2), Kåre J. Kristoffersen(2), Paul Pettersson(2), Antoine Meyer(2)