Fabien Coulon

According to our database, Fabien Coulon authored at least 13 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

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

Fabien Coulon

PhD thesis, 2022

2020

Modular and distributed IDE.

Fabien Coulon, Alex Auvolat, Benoît Combemale, Yérom-David Bromberg, François Taïani, Olivier Barais, Noël Plouzeau

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, 2020

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

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

Fabien Coulon, Thomas Degueule, Tijs van der Storm, Benoît Combemale

Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering, 2018

2016

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

Valéria Lelli, Arnaud Blouin, Benoit Baudry, Fabien Coulon, Olivier Beaudoux

Proceedings of the 8th ACM SIGCHI Symposium on Engineering Interactive Computing Systems, 2016

2015

On model-based testing advanced GUIs.

Valéria Lelli, Arnaud Blouin, Benoit Baudry, Fabien Coulon

Proceedings of the Eighth IEEE International Conference on Software Testing, 2015

2006

Fast algorithms for identifying maximal common connected sets of interval graphs.

Fabien Coulon, Mathieu Raffinot

Discret. Appl. Math., 2006

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

Brute force determinization of nfas by means of state covers.

Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën

Int. J. Found. Comput. Sci., 2005

Enumerating nondeterministic automata for a given language without constructing the canonical automaton.

Jean-Marc Champarnaud, Fabien Coulon

Int. J. Found. Comput. Sci., 2005

2004

NFA reduction algorithms by means of regular inequalities.

Jean-Marc Champarnaud, Fabien Coulon

Theor. Comput. Sci., 2004

Compact and fast algorithms for safe regular expression search.

Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën

Int. J. Comput. Math., 2004

2003

Theoretical study and implementation of the canonical automaton.

Jean-Marc Champarnaud, Fabien Coulon

Fundam. Informaticae, 2003