Follow
Olivier Serre
Olivier Serre
IRIF (Université de Paris & CNRS)
Verified email at cnrs.fr - Homepage
Title
Cited by
Cited by
Year
Collapsible pushdown automata and recursion schemes
M Hague, AS Murawski, CHL Ong, O Serre
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 452-461, 2008
1702008
Visibly pushdown games
C Löding, P Madhusudan, O Serre
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005
952005
Parity games played on transition graphs of one-counter processes
O Serre
International Conference on Foundations of Software Science and Computation …, 2006
832006
Recursion schemes and logical reflection
CH Broadbent, A Carayol, CHL Ong, O Serre
2010 25th Annual IEEE Symposium on Logic in Computer Science, 120-129, 2010
692010
Regularity problems for visibly pushdown languages
V Bárány, C Löding, O Serre
STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006
612006
Note on winning positions on pushdown games with ω-regular conditions
O Serre
Information Processing Letters 85 (6), 285-291, 2003
572003
Pushdown games with unboundedness and regular conditions
AJ Bouquet, O Serre, I Walukiewicz
FST TCS 2003: Foundations of Software Technology and Theoretical Computer …, 2003
552003
Propositional dynamic logic with recursive programs
C Löding, C Lutz, O Serre
The Journal of Logic and Algebraic Programming 73 (1-2), 51-69, 2007
542007
Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection
A Carayol, O Serre
2012 27th Annual IEEE Symposium on Logic in Computer Science, 165-174, 2012
512012
A saturation method for collapsible pushdown systems
C Broadbent, A Carayol, M Hague, O Serre
International Colloquium on Automata, Languages, and Programming, 165-176, 2012
452012
Winning regions of higher-order pushdown games
A Carayol, M Hague, A Meyer, CHL Ong, O Serre
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 193-204, 2008
442008
Pushdown module checking with imperfect information
B Aminof, A Legay, A Murano, O Serre, MY Vardi
Information and Computation 223, 1-17, 2013
422013
C-shore: a collapsible approach to higher-order verification
C Broadbent, A Carayol, M Hague, O Serre
ACM SIGPLAN Notices 48 (9), 13-24, 2013
352013
Randomization in automata on infinite trees
A Carayol, A Haddad, O Serre
ACM Transactions on Computational Logic (TOCL) 15 (3), 1-33, 2014
292014
Games with winning conditions of high Borel complexity
O Serre
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
282004
Qualitative concurrent stochastic games with imperfect information
V Gripon, O Serre
International Colloquium on Automata, Languages, and Programming, 200-211, 2009
252009
Contribution ŕ l'étude des jeux sur des graphes de processus ŕ pile
O Serre
Université Paris VIII Vincennes-Saint Denis, 2004
242004
Collapsible pushdown automata and recursion schemes
M Hague, AS Murawski, CHL Ong, O Serre
ACM Transactions on Computational Logic (TOCL) 18 (3), 1-42, 2017
222017
Streaming property testing of visibly pushdown languages
N François, F Magniez, M De Rougemont, O Serre
arXiv preprint arXiv:1505.03334, 2015
192015
Tree pattern rewriting systems
B Genest, A Muscholl, O Serre, M Zeitoun
International Symposium on Automated Technology for Verification and …, 2008
172008
The system can't perform the operation now. Try again later.
Articles 1–20