Philippe Schnoebelen
Orcid: 0000-0001-8180-2686Affiliations:
- ENS Cachan, Specification and Verification Laboratory (LSV)
According to our database1,
Philippe Schnoebelen
authored at least 104 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
2023
Proceedings of the Combinatorics on Words - 14th International Conference, 2023
2021
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021
2019
Log. Methods Comput. Sci., 2019
The height of piecewise-testable languages and the complexity of the logic of subwords.
Log. Methods Comput. Sci., 2019
Inf. Process. Lett., 2019
2017
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk).
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
Decidability, complexity, and expressiveness of first-order logic over the subword ordering.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
2016
On the state complexity of closures and interiors of regular languages with subwords and superwords.
Theor. Comput. Sci., 2016
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016
2015
Inf. Process. Lett., 2015
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences.
CoRR, 2015
Log. Methods Comput. Sci., 2015
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
2014
Proceedings of the Reachability Problems - 8th International Workshop, 2014
On the State Complexity of Closures and Interiors of Regular Languages with Subwords.
Proceedings of the Descriptional Complexity of Formal Systems, 2014
2013
Formal Methods Syst. Des., 2013
Proceedings of the Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, 2013
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013
2012
Formal Aspects Comput., 2012
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
Proceedings of the Theoretical Computer Science, 2012
Proceedings of the Computer Science - Theory and Applications, 2012
2011
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
2010
Proceedings of the Reachability Problems, 4th International Workshop, 2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Foundations of Software Science and Computational Structures, 2010
Proceedings of the Developments in Language Theory, 14th International Conference, 2010
2008
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008
Proceedings of the Foundations of Software Science and Computational Structures, 2008
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008
2007
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.
ACM Trans. Comput. Log., 2007
Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007
2006
A general approach to comparing infinite-state systems with their finite-state specifications.
Theor. Comput. Sci., 2006
J. Comput. Syst. Sci., 2006
Inf. Process. Lett., 2006
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.
Proceedings of the Logic for Programming, 2006
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006
2005
Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties
CoRR, 2005
Proceedings of the Automated Technology for Verification and Analysis, 2005
2004
Inf. Process. Lett., 2004
Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004
Proceedings of the Formal Techniques, 2004
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004
2003
Theor. Comput. Sci., 2003
Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003.
Proceedings of INFINITY 2003, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the Foundations of Software Science and Computational Structures, 2003
2002
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems.
Nord. J. Comput., 2002
Inf. Process. Lett., 2002
Inf. Comput., 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002
Proceedings of the Foundations of Software Science and Computation Structures, 2002
Proceedings of the Algebraic Methodology and Software Technology, 2002
Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002
2001
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001
Proceedings of the Foundations of Software Science and Computation Structures, 2001
Springer, ISBN: 9783540415237, 2001
2000
Proceedings of the IEEE International Conference on Systems, 2000
Proceedings of the Foundations of Software Science and Computation Structures, 2000
Proceedings of the Foundations of Software Science and Computation Structures, 2000
Proceedings of the Application and Theory of Petri Nets 2000, 2000
1999
Proceedings of the Perspectives of System Informatics, 1999
1998
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract).
Proceedings of the STACS 98, 1998
Proceedings of the LATIN '98: Theoretical Informatics, 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
1997
Proceedings of the International Workshop on Expressiveness in Concurrency, 1997
Proceedings of the Parallel Computing Technologies, 1997
1996
Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996
1995
1994
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
1992
Proceedings of the Application and Theory of Petri Nets 1992, 1992
1991
J. Symb. Comput., 1991
Inf. Process. Lett., 1991
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991
1990
Proceedings of the ESOP'90, 1990
1988
Sci. Comput. Program., 1988
1987
Proceedings of the PARLE, 1987
Proceedings of the PARLE, 1987