ExStream is a research project funded by ANR (2014-2018).
It stands for Extensions of Stream processing.

Our objective is to characterize tasks (like XML validation) that can be efficiently performed in streaming mode, and propose efficient algorithms for them.



  • @ Brussels

    Oct. 30th to Nov. 3rd, 2017. Visit of Nathan Lhote.

  • Midterm meeting

    Feb 8th to Feb 10th, 2017. Bordeaux.

  • @ Bordeaux

    Mar. 21st to Apr. 8th, 2016. Visit of Nathan Lhote.

  • @ Brussels

    Nov. 9th to Nov. 13th, 2015. Visit of Nathan Lhote.

  • @ Brussels

    Mar. 30th to Apr. 3rd, 2015. Visit of Nathan Lhote.

  • @ Marseille

    Oct. 22nd to 23rd, 2014. Visit of Olivier Gauwin and Emmanuel Filiot.

  • KickOff meeting

    Apr. 14th to 18th, 2014 @ Bordeaux. Visit of Frédéric Servais and Emmanuel Filiot.


On Reversible Transducers

Luc Dartois, Ismaël Jecker, Nathan Lhote. Under submission.

Decidable Logics for Transductions and Data Words

Luc Dartois, Emmanuel Filiot, Nathan Lhote. Under submission.

Untwisting two-way transducers in elementary time

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. Under submission.

Separating Regular Languages with First-Order Logic

Thomas Place, Marc Zeitoun. LMCS 2016.

Aperiodicity of rational functions is PSpace-complete

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote. FSTTCS 2016.

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics

Thomas Place, Marc Zeitoun. MFCS 2016.

Minimizing resources of sweeping and streaming string transducers

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. ICALP 2016.

On Equivalence and Uniformisation Problems for Finite Transducers

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter. ICALP 2016.

Transducers, logic and algebra for functions of finite words

Emmanuel Filiot, Pierre-Alain Reynier. ACM SIGLOG News 3(3), 2016.

First-order definability of rational transductions: An algebraic approach

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote. LICS 2016.

Quantifier Alternation for Infinite Words

Théo Pierron, Thomas Place, Marc Zeitoun. FoSSaCS 2016.

Deciding definability in FO2(<h, <v) on trees

Thomas Place, Luc Segoufin. LMCS 2015.

Logics with Rigidly Guarded Data Tests

Thomas Colcombet, Clemens Ley, Gabriele Puppis. LMCS 2015.

One-way definability of sweeping transducers

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. FSTTCS 2015.

The tale of the quantifier alternation hierarchy of first-order logic over words

Thomas Place, Marc Zeitoun. SIGLOG News 2(3), 2015.

Separating Regular Languages with Two Quantifier Alternations

Thomas Place. LICS 2015.

Which XML schemas are streaming bounded repairable?

Pierre Bourhis, Gabriele Puppis, Cristian Riveros. Theory of Computing Systems, 2015.

Walking on Data Words

Amaldev Manuel, Anca Muscholl, Gabriele Puppis. Theory of Computing Systems, 2015.

Separation and the Successor Relation

Thomas Place, Marc Zeitoun. STACS 2015.

Multi-Sequential Word Relations

Ismaël Jecker, Emmanuel Filiot. DLT 2015.

Logic-Automata Connections for Transformations

Emmanuel Filiot. ICLA 2015.

First-order Definable String Transformations

Emmanuel Filiot, Shankara Narayanan Krishna, Ashutosh Trivedi. FSTTCS 2014.

Cover template for Bootstrap, by @mdo. Testimonials by KeenThemes.