Theoretical study and implementation of the canonical automaton. - Jean-Marc Champarnaud; Fabien Coulon (Fundam. Informaticae, 2003)

Compact and fast algorithms for safe regular expression search. - Jean-Marc Champarnaud; Fabien Coulon; Thomas Paranthoën (Int. J. Comput. Math., 2004)

NFA reduction algorithms by means of regular inequalities. - Jean-Marc Champarnaud; Fabien Coulon (Theor. Comput. Sci., 2004)

Enumerating nondeterministic automata for a given language without constructing the canonical automaton. - Jean-Marc Champarnaud; Fabien Coulon (Int. J. Found. Comput. Sci., 2005)

Brute force determinization of nfas by means of state covers. - Jean-Marc Champarnaud; Fabien Coulon; Thomas Paranthoën (Int. J. Found. Comput. Sci., 2005)

Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. - Jean-Marc Champarnaud; Fabien Coulon (Theor. Comput. Sci., 2005)

Fast algorithms for identifying maximal common connected sets of interval graphs. - Fabien Coulon; Mathieu Raffinot (Discret. Appl. Math., 2006)

On model-based testing advanced GUIs. - Valéria Lelli; Arnaud Blouin; Benoit Baudry; Fabien Coulon (ICST Workshops, 2015)

Automatic detection of GUI design smells: the case of Blob listener. - Valéria Lelli; Arnaud Blouin; Benoit Baudry; Fabien Coulon; Olivier Beaudoux (EICS, 2016)

Shape-diverse DSLs: languages without borders (vision paper). - Fabien Coulon; Thomas Degueule; Tijs van der Storm; Benoît Combemale (SLE, 2018)

User interface design smell: Automatic detection and refactoring of Blob listeners. - Arnaud Blouin; Valéria Lelli; Benoit Baudry; Fabien Coulon (Inf. Softw. Technol., 2018)

Modular and distributed IDE. - Fabien Coulon; Alex Auvolat; Benoît Combemale; Yérom-David Bromberg; François Taïani; Olivier Barais; Noël Plouzeau (SLE, 2020)

Towards flexible Integrated Development Environment. (Vers un environnement de développement intégré flexible). - Fabien Coulon (2022)