François Laroussinie

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 8

Top Topics

Quantified Boolean Formulae

Formal Specification

Top Venues

Publications

François Laroussinie, Loriane Leclercq, Arnaud Sangnier
QLTL Model-Checking. CSL (2024)
Akash Hossain, François Laroussinie
QCTL model-checking with QBF solvers. Inf. Comput. 280 (2021)
Akash Hossain, François Laroussinie
QCTL model-checking with QBF solvers. CoRR (2020)
Akash Hossain, François Laroussinie
From Quantified CTL to QBF. CoRR (2019)
Carole Delporte-Gallet, Hugues Fauconnier, Yan Jurski, François Laroussinie, Arnaud Sangnier
Towards Synthesis of Distributed Algorithms with SMT Solvers. NETYS (2019)
Akash Hossain, François Laroussinie
From Quantified CTL to QBF. TIME (2019)
Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, James Worrell
Timed Temporal Logics. Models, Algorithms, Logics and Tools (2017)
Amélie David, François Laroussinie, Nicolas Markey
On the Expressiveness of QCTL. CONCUR (2016)
François Laroussinie, Nicolas Markey, Arnaud Sangnier
ATLsc with partial observation. GandALF (2015)
François Laroussinie, Nicolas Markey
Augmenting ATL with strategy contexts. Inf. Comput. 245 (2015)
François Laroussinie, Nicolas Markey
Quantified CTL: Expressiveness and Complexity. Log. Methods Comput. Sci. 10 (4) (2014)
François Laroussinie, Nicolas Markey
Satisfiability of ATL with strategy contexts. GandALF (2013)
François Laroussinie, Antoine Meyer, Eudes Petonnet
Counting CTL Log. Methods Comput. Sci. 9 (1) (2012)
Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey
Quantified CTL: Expressiveness and Model Checking - (Extended Abstract). CONCUR (2012)
Patricia Bouyer, Franck Cassez, François Laroussinie
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control. J. Log. Lang. Inf. 20 (2) (2011)
François Laroussinie, Antoine Meyer, Eudes Petonnet
Counting CTL. FoSSaCS (2010)
François Laroussinie, Antoine Meyer, Eudes Petonnet
Counting LTL. TIME (2010)
François Laroussinie
. MIT Press (May 2008).ISBN: 978-0-262-02649-9, 975 pp. Hardcover. Comput. J. 53 (5) (2010)
Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey
ATL with Strategy Contexts: Expressiveness and Model Checking. FSTTCS (2010)
François Laroussinie
Temporal Logics for Games. Bull. EATCS 100 (2010)
Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey
ATL with Strategy Contexts and Bounded Memory. LFCS (2009)
Marcin Jurdzinski, Jeremy Sproston, François Laroussinie
Model Checking Probabilistic Timed Automata with One or Two Clocks. Log. Methods Comput. Sci. 4 (3) (2008)
François Laroussinie, Nicolas Markey, Ghassan Oreiby
On the Expressiveness and Complexity of ATL CoRR (2008)
Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
Model Checking Probabilistic Timed Automata with One or Two Clocks CoRR (2008)
François Laroussinie, Nicolas Markey, Ghassan Oreiby
On the Expressiveness and Complexity of ATL. Log. Methods Comput. Sci. 4 (2) (2008)
Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby
Timed Concurrent Game Structures. CONCUR (2007)
François Laroussinie, Nicolas Markey, Ghassan Oreiby
On the Expressiveness and Complexity of ATL. FoSSaCS (2007)
Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS (2007)
François Laroussinie, Jeremy Sproston
State explosion in almost-sure probabilistic reachability. Inf. Process. Lett. 102 (6) (2007)
Stéphane Demri, François Laroussinie, Philippe Schnoebelen
A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72 (4) (2006)
François Laroussinie, Nicolas Markey, Ghassan Oreiby
Model-Checking Timed. FORMATS (2006)
Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
Timed Temporal Logics for Abstracting Transient States. ATVA (2006)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353 (1-3) (2006)
Paul Caspi, Alberto L. Sangiovanni-Vincentelli, Luís Almeida, Albert Benveniste, Bruno Bouyssounouse, Giorgio C. Buttazzo, Ivica Crnkovic, Werner Damm, Jakob Engblom, Gerhard Fohler, Marisol García-Valls, Hermann Kopetz, Yassine Lakhnech, François Laroussinie, Luciano Lavagno, Giuseppe Lipari, Florence Maraninchi, Philipp Peti, Juan Antonio de la Puente, Norman Scaife, Joseph Sifakis, Robert de Simone, Martin Törngren, Paulo Veríssimo, Andy J. Wellings, Reinhard Wilhelm, Tim A. C. Willemse, Wang Yi
Guidelines for a graduate curriculum on embedded software and systems. ACM Trans. Embed. Comput. Syst. 4 (3) (2005)
Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS (2005)
Patricia Bouyer, Franck Cassez, François Laroussinie
Modal Logics for Timed Control. CONCUR (2005)
Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
A New Modality for Almost Everywhere Properties in Timed Automata. CONCUR (2005)
François Laroussinie, Jeremy Sproston
Model Checking Durational Probabilistic Systems. FoSSaCS (2005)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
Model Checking Timed Automata with One or Two Clocks. CONCUR (2004)
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297 (1-3) (2003)
Luca Aceto, François Laroussinie
Is your model checker on time? On the complexity of model checking for timed modal logics. J. Log. Algebraic Methods Program. (2002)
Stéphane Demri, François Laroussinie, Philippe Schnoebelen
A Parametric Analysis of the State Explosion Problem in Model Checking. STACS (2002)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
Temporal Logic with Forgettable Past. LICS (2002)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
On Model Checking Durational Kripke Structures. FoSSaCS (2002)
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
and FCTL is Hard. FoSSaCS (2001)
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN (2000)
François Laroussinie, Philippe Schnoebelen
The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS (2000)
François Laroussinie, Philippe Schnoebelen
Specification in CTL+Past for Verification in CTL. Inf. Comput. 156 (1-2) (2000)
Franck Cassez, François Laroussinie
Model-Checking for Hybrid Systems by Quotienting and Constraints Solving. CAV (2000)
Luca Aceto, François Laroussinie
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. MFCS (1999)
François Laroussinie, Kim Guldstrand Larsen
CMC: A Tool for Compositional Model-Checking of Real-Time Systems. FORTE (1998)
François Laroussinie, Philippe Schnoebelen
Specification in CTL+Past, verification in CTL. EXPRESS (1997)
Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
A Compositional Proof of a Real-Time Mutual Exclusion Protocol. TAPSOFT (1997)
François Laroussinie
About the Expressive Power of CTL Combinators. Inf. Process. Lett. 54 (6) (1995)
François Laroussinie, Philippe Schnoebelen
A Hierarchy of Temporal Logics with Past. Theor. Comput. Sci. 148 (2) (1995)
François Laroussinie, Kim Guldstrand Larsen, Carsten Weise
From Timed Automata to Logic - and Back. MFCS (1995)
François Laroussinie, Kim Guldstrand Larsen
Compositional Model Checking of Real Time Systems. CONCUR (1995)
François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140 (1) (1995)
François Laroussinie, Philippe Schnoebelen
A Hierarchy of Temporal Logics with Past (Extended Abstract). STACS (1994)
François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
Translation Results for Modal Logics of Reactive Systems. AMAST (1993)