default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Laroussinie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]François Laroussinie, Loriane Leclercq
, Arnaud Sangnier:
QLTL Model-Checking. CSL 2024: 35:1-35:18- 2021
- [j19]Akash Hossain, François Laroussinie:
QCTL model-checking with QBF solvers. Inf. Comput. 280: 104642 (2021) - 2020
- [i4]Akash Hossain, François Laroussinie:
QCTL model-checking with QBF solvers. CoRR abs/2010.03185 (2020)
2010 – 2019
- 2019
- [c36]Carole Delporte-Gallet, Hugues Fauconnier, Yan Jurski, François Laroussinie, Arnaud Sangnier:
Towards Synthesis of Distributed Algorithms with SMT Solvers. NETYS 2019: 200-216 - [c35]Akash Hossain, François Laroussinie:
From Quantified CTL to QBF. TIME 2019: 11:1-11:20 - [i3]Akash Hossain, François Laroussinie:
From Quantified CTL to QBF. CoRR abs/1906.10005 (2019) - 2017
- [c34]Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, James Worrell:
Timed Temporal Logics. Models, Algorithms, Logics and Tools 2017: 211-230 - 2016
- [c33]Amélie David, François Laroussinie, Nicolas Markey:
On the Expressiveness of QCTL. CONCUR 2016: 28:1-28:15 - 2015
- [j18]François Laroussinie, Nicolas Markey:
Augmenting ATL with strategy contexts. Inf. Comput. 245: 98-123 (2015) - [c32]François Laroussinie, Nicolas Markey, Arnaud Sangnier:
ATLsc with partial observation. GandALF 2015: 43-57 - 2014
- [j17]François Laroussinie, Nicolas Markey:
Quantified CTL: Expressiveness and Complexity. Log. Methods Comput. Sci. 10(4) (2014) - [e2]Amedeo Cesta, Carlo Combi, François Laroussinie:
21st International Symposium on Temporal Representation and Reasoning, TIME 2014, Verona, Italy, September 8-10, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-4228-2 [contents] - 2013
- [c31]François Laroussinie, Nicolas Markey:
Satisfiability of ATL with strategy contexts. GandALF 2013: 208-223 - 2012
- [j16]François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting CTL. Log. Methods Comput. Sci. 9(1) (2012) - [c30]Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
Quantified CTL: Expressiveness and Model Checking - (Extended Abstract). CONCUR 2012: 177-192 - 2011
- [j15]Patricia Bouyer, Franck Cassez, François Laroussinie:
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control. J. Log. Lang. Inf. 20(2): 169-203 (2011) - 2010
- [j14]François Laroussinie:
Christel Baier and Joost-Pieter KatoenPrinciples of Model Checking. MIT Press (May 2008).ISBN: 978-0-262-02649-9, 975 pp. Hardcover. Comput. J. 53(5): 615-616 (2010) - [j13]François Laroussinie:
Temporal Logics for Games. Bull. EATCS 100: 79-98 (2010) - [c29]François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting CTL. FoSSaCS 2010: 206-220 - [c28]Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
ATL with Strategy Contexts: Expressiveness and Model Checking. FSTTCS 2010: 120-132 - [c27]François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting LTL. TIME 2010: 51-58 - [e1]Paul Gastin, François Laroussinie:
CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Lecture Notes in Computer Science 6269, Springer 2010, ISBN 978-3-642-15374-7 [contents]
2000 – 2009
- 2009
- [c26]Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
ATL with Strategy Contexts and Bounded Memory. LFCS 2009: 92-106 - 2008
- [j12]François Laroussinie, Nicolas Markey, Ghassan Oreiby:
On the Expressiveness and Complexity of ATL. Log. Methods Comput. Sci. 4(2) (2008) - [j11]Marcin Jurdzinski, Jeremy Sproston, François Laroussinie:
Model Checking Probabilistic Timed Automata with One or Two Clocks. Log. Methods Comput. Sci. 4(3) (2008) - [i2]François Laroussinie, Nicolas Markey, Ghassan Oreiby:
On the Expressiveness and Complexity of ATL. CoRR abs/0804.2435 (2008) - [i1]Marcin Jurdzinski, François Laroussinie, Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks. CoRR abs/0809.0060 (2008) - 2007
- [j10]François Laroussinie, Jeremy Sproston:
State explosion in almost-sure probabilistic reachability. Inf. Process. Lett. 102(6): 236-241 (2007) - [c25]Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby:
Timed Concurrent Game Structures. CONCUR 2007: 445-459 - [c24]François Laroussinie, Nicolas Markey, Ghassan Oreiby:
On the Expressiveness and Complexity of ATL. FoSSaCS 2007: 243-257 - [c23]Marcin Jurdzinski, François Laroussinie, Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS 2007: 170-184 - 2006
- [j9]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): 547-575 (2006) - [j8]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353(1-3): 249-271 (2006) - [c22]Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie:
Timed Temporal Logics for Abstracting Transient States. ATVA 2006: 337-351 - [c21]François Laroussinie, Nicolas Markey, Ghassan Oreiby:
Model-Checking Timed. FORMATS 2006: 245-259 - 2005
- [j7]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): 587-611 (2005) - [c20]Patricia Bouyer, Franck Cassez, François Laroussinie:
Modal Logics for Timed Control. CONCUR 2005: 81-94 - [c19]Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie:
A New Modality for Almost Everywhere Properties in Timed Automata. CONCUR 2005: 110-124 - [c18]Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier:
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS 2005: 112-126 - [c17]François Laroussinie, Jeremy Sproston:
Model Checking Durational Probabilistic Systems. FoSSaCS 2005: 140-154 - 2004
- [c16]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking Timed Automata with One or Two Clocks. CONCUR 2004: 387-401 - 2003
- [j6]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1-3): 297-315 (2003) - 2002
- [j5]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. 52-53: 7-51 (2002) - [c15]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
On Model Checking Durational Kripke Structures. FoSSaCS 2002: 264-279 - [c14]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Temporal Logic with Forgettable Past. LICS 2002: 383-392 - [c13]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A Parametric Analysis of the State Explosion Problem in Model Checking. STACS 2002: 620-631 - 2001
- [b1]Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie:
Systems and Software Verification, Model-Checking Techniques and Tools. Springer 2001, ISBN 978-3-642-07478-3, pp. I-XII, 1-190 - [c12]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking CTL+ and FCTL is Hard. FoSSaCS 2001: 318-331 - 2000
- [j4]François Laroussinie, Philippe Schnoebelen:
Specification in CTL+Past for Verification in CTL. Inf. Comput. 156(1-2): 236-263 (2000) - [c11]Franck Cassez, François Laroussinie:
Model-Checking for Hybrid Systems by Quotienting and Constraints Solving. CAV 2000: 373-388 - [c10]François Laroussinie, Philippe Schnoebelen:
The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS 2000: 192-207 - [c9]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446
1990 – 1999
- 1999
- [c8]Luca Aceto, François Laroussinie:
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. MFCS 1999: 125-136 - 1998
- [c7]François Laroussinie, Kim Guldstrand Larsen:
CMC: A Tool for Compositional Model-Checking of Real-Time Systems. FORTE 1998: 439-456 - 1997
- [c6]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: 565-579 - [c5]François Laroussinie, Philippe Schnoebelen:
Specification in CTL+Past, verification in CTL. EXPRESS 1997: 161-184 - 1995
- [j3]François Laroussinie:
About the Expressive Power of CTL Combinators. Inf. Process. Lett. 54(6): 343-345 (1995) - [j2]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140(1): 53-71 (1995) - [j1]François Laroussinie, Philippe Schnoebelen:
A Hierarchy of Temporal Logics with Past. Theor. Comput. Sci. 148(2): 303-324 (1995) - [c4]François Laroussinie, Kim Guldstrand Larsen:
Compositional Model Checking of Real Time Systems. CONCUR 1995: 27-41 - [c3]François Laroussinie, Kim Guldstrand Larsen, Carsten Weise:
From Timed Automata to Logic - and Back. MFCS 1995: 529-539 - 1994
- [c2]François Laroussinie, Philippe Schnoebelen:
A Hierarchy of Temporal Logics with Past (Extended Abstract). STACS 1994: 47-58 - 1993
- [c1]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translation Results for Modal Logics of Reactive Systems. AMAST 1993: 297-306
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
