François Laroussinie

According to our database1, François Laroussinie authored at least 50 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
QLTL Model-Checking.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2021
QCTL model-checking with QBF solvers.
Inf. Comput., 2021

2019
From Quantified CTL to QBF.
Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

Towards Synthesis of Distributed Algorithms with SMT Solvers.
Proceedings of the Networked Systems - 7th International Conference, 2019

2017
Timed Temporal Logics.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
On the Expressiveness of QCTL.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Augmenting ATL with strategy contexts.
Inf. Comput., 2015

ATLsc with partial observation.
Proceedings of the Proceedings Sixth International Symposium on Games, 2015

2014
Quantified CTL: Expressiveness and Complexity.
Log. Methods Comput. Sci., 2014

2013
Satisfiability of ATL with strategy contexts.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

2012
Counting CTL
Log. Methods Comput. Sci., 2012

Quantified CTL: Expressiveness and Model Checking - (Extended Abstract).
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control.
J. Log. Lang. Inf., 2011

2010
Temporal Logics for Games.
Bull. EATCS, 2010

Christel Baier and Joost-Pieter Katoen<i>Principles of Model Checking</i>. MIT Press (May 2008).ISBN: 978-0-262-02649-9, 975 pp. Hardcover.
Comput. J., 2010

Counting LTL.
Proceedings of the TIME 2010, 2010

ATL with Strategy Contexts: Expressiveness and Model Checking.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
ATL with Strategy Contexts and Bounded Memory.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008
On the Expressiveness and Complexity of ATL.
Log. Methods Comput. Sci., 2008

Model Checking Probabilistic Timed Automata with One or Two Clocks.
Log. Methods Comput. Sci., 2008

2007
State explosion in almost-sure probabilistic reachability.
Inf. Process. Lett., 2007

Timed Concurrent Game Structures.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Efficient timed model checking for discrete-time systems.
Theor. Comput. Sci., 2006

A parametric analysis of the state-explosion problem in model checking.
J. Comput. Syst. Sci., 2006

Model-Checking Timed.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Timed Temporal Logics for Abstracting Transient States.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Guidelines for a graduate curriculum on embedded software and systems.
ACM Trans. Embed. Comput. Syst., 2005

Model Checking Durational Probabilistic Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

A New Modality for Almost Everywhere Properties in Timed Automata.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Modal Logics for Timed Control.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Model Checking Timed Automata with One or Two Clocks.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
On the expressivity and complexity of quantitative branching-time temporal logics.
Theor. Comput. Sci., 2003

2002
Is your model checker on time? On the complexity of model checking for timed modal logics.
J. Log. Algebraic Methods Program., 2002

Temporal Logic with Forgettable Past.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

On Model Checking Durational Kripke Structures.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Model Checking CTL<sup>+</sup> and FCTL is Hard.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Systems and Software Verification, Model-Checking Techniques and Tools.
Springer, ISBN: 9783540415237, 2001

2000
The State Explosion Problem from Trace to Bisimulation Equivalence.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

Model-Checking for Hybrid Systems by Quotienting and Constraints Solving.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1998
CMC: A Tool for Compositional Model-Checking of Real-Time Systems.
Proceedings of the Formal Description Techniques and Protocol Specification, 1998

1997
Specification in CTL+Past, verification in CTL.
Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

A Compositional Proof of a Real-Time Mutual Exclusion Protocol.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995
A Hierarchy of Temporal Logics with Past.
Theor. Comput. Sci., 1995

Translations Between Modal Logics of Reactive Systems.
Theor. Comput. Sci., 1995

About the Expressive Power of CTL Combinators.
Inf. Process. Lett., 1995

From Timed Automata to Logic - and Back.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Compositional Model Checking of Real Time Systems.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
A Hierarchy of Temporal Logics with Past (Extended Abstract).
Proceedings of the STACS 94, 1994

1993
Translation Results for Modal Logics of Reactive Systems.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993


  Loading...