F. Coulon

Compact and Fast Algorithms for Regular Expression Search

Jean-Marc Champarnaud, F. Coulon, T. Paranthoën, 2004 .

Enumeration of nondeterministic automata for a given language: a technique that avoids the universal automaton

Jean-Marc Champarnaud, F. Coulon, 2005 .

On model-based testing advanced GUIs

Arnaud Blouin, Benoit Baudry, Fabien Coulon, 2015, 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW).

User Interface Design Smell: Automatic Detection and Refactoring of Blob Listeners

Arnaud Blouin, Benoit Baudry, Fabien Coulon, 2017, Inf. Softw. Technol..

Fast algorithms for identifying maximal common connected sets of interval graphs

Mathieu Raffinot, Fabien Coulon, F. Coulon, 2006, Discret. Appl. Math..

Automatic detection of GUI design smells: the case of Blob listener

Arnaud Blouin, Benoit Baudry, Olivier Beaudoux, 2016, EICS.

NFA reduction algorithms by means of regular inequalities

Jean-Marc Champarnaud, Fabien Coulon, Jean-Marc Champarnaud, 2004, Theor. Comput. Sci..

Shape-diverse DSLs: languages without borders (vision paper)

Benoît Combemale, Tijs van der Storm, Thomas Degueule, 2018, SLE.

Compact and fast algorithms for safe regular expression search

Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën, 2004, Int. J. Comput. Math..

Theoretical study and implementation of the canonical automaton

Jean-Marc Champarnaud, Fabien Coulon, Jean-Marc Champarnaud, 2002, Fundam. Informaticae.

ACTIVITY REPORT Project-Team DIVERSE

Olivier Barais, J. Jézéquel, F. Coulon, 2022 .