Frédéric Servais
Frédéric Servais
Lecturer at École Supérieure d'Informatique (ESI) in Brussels
Verifisert e-postadresse på ulb.ac.be
Tittel
Sitert av
Sitert av
År
Visibly pushdown transducers
JF Raskin, F Servais
International Colloquium on Automata, Languages, and Programming, 386-397, 2008
462008
Properties of visibly pushdown transducers
E Filiot, JF Raskin, PA Reynier, F Servais, JM Talbot
International Symposium on Mathematical Foundations of Computer Science, 355-367, 2010
402010
From two-way to one-way finite state transducers
E Filiot, O Gauwin, PA Reynier, F Servais
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 468-477, 2013
382013
Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
PA Reynier, F Servais
International Conference on Application and Theory of Petri Nets and …, 2011
342011
Streamability of nested word transductions
E Filiot, O Gauwin, PA Reynier, F Servais
arXiv preprint arXiv:1707.00527, 2017
212017
Definability problems for graph query languages
T Antonopoulos, F Neven, F Servais
ICDT 2013 - 16th International Conference on Database Theory, 2013
202013
Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
PA Reynier, F Servais
Fundamenta Informaticae 122 (1-2), 1-30, 2013
182013
Visibly pushdown transducers
F Servais, JF Raskin
ULB, Belgique, 2011
152011
Visibly pushdown transducers with look-ahead
E Filiot, F Servais
International Conference on Current Trends in Theory and Practice of …, 2012
122012
On the symbolic computation of the hardest configurations of the rush hour game
S Collette, JF Raskin, F Servais
Computers and Games, 220-233, 2007
102007
Distributed streaming with finite memory
F Neven, N Schweikardt, F Servais, T Tan
18th International Conference on Database Theory (ICDT 2015), 2015
92015
On functionality of visibly pushdown transducers
E Filiot, JF Raskin, PA Reynier, F Servais, JM Talbot
arXiv preprint arXiv:1002.1443, 2010
82010
Expressiveness of visibly pushdown transducers
M Caralp, E Filiot, PA Reynier, F Servais, JM Talbot
arXiv preprint arXiv:1311.5571, 2013
72013
Visibly pushdown transducers
E Filiot, JF Raskin, PA Reynier, F Servais, JM Talbot
Journal of Computer and System Sciences 97, 147-181, 2018
62018
Finding hard initial configurations of Rush Hour with binary decision diagrams
F Servais
M. Sc. thesis, Université libre de Bruxelles, Faculté des sciences, 2005
62005
XEvolve: an XML schema evolution framework
F Picalausa, F Servais, E Zimányi
Proceedings of the 2011 ACM Symposium on Applied Computing, 1645-1650, 2011
52011
On the computation of the minimal coverability set of Petri nets
PA Reynier, F Servais
International Conference on Reachability Problems, 164-177, 2019
32019
Verifying and testing BPEL processes
F Servais
Master's thesis, Université Libre de Bruxelles 2007, 2006
22006
Finite-state map-reduce computation and relational algebra queries
F Neven, N Schweikardt, F Servais, T Tan
ACM Transactions on Computational Logic (TOCL) 19 (2), 1-37, 2018
12018
Height-bounded memory visibly pushdown transductions
E Filiot, O Gauwin, PA Reynier, F Servais
Submitted, 2011
12011
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20