default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Coulon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]Fabien Coulon:
Towards flexible Integrated Development Environment. (Vers un environnement de développement intégré flexible). University of Rennes 1, France, 2022- 2020
- [c6]Fabien Coulon, Alex Auvolat
, Benoît Combemale, Yérom-David Bromberg, François Taïani, Olivier Barais, Noël Plouzeau:
Modular and distributed IDE. SLE 2020: 270-282
2010 – 2019
- 2018
- [j8]Arnaud Blouin, Valéria Lelli, Benoit Baudry, Fabien Coulon:
User interface design smell: Automatic detection and refactoring of Blob listeners. Inf. Softw. Technol. 102: 49-64 (2018) - [c5]Fabien Coulon, Thomas Degueule, Tijs van der Storm, Benoît Combemale:
Shape-diverse DSLs: languages without borders (vision paper). SLE 2018: 215-219 - 2017
- [i2]Valéria Lelli, Arnaud Blouin, Benoit Baudry, Fabien Coulon, Olivier Beaudoux:
Automatic Detection of GUI Design Smells: The Case of Blob Listener. CoRR abs/1703.08803 (2017) - [i1]Arnaud Blouin, Valéria Lelli, Benoit Baudry, Fabien Coulon:
User Interface Design Smell: Automatic Detection and Refactoring of Blob Listeners. CoRR abs/1703.10674 (2017) - 2016
- [c4]Valéria Lelli, Arnaud Blouin, Benoit Baudry, Fabien Coulon, Olivier Beaudoux:
Automatic detection of GUI design smells: the case of Blob listener. EICS 2016: 263-274 - 2015
- [c3]Valéria Lelli, Arnaud Blouin, Benoit Baudry, Fabien Coulon:
On model-based testing advanced GUIs. ICST Workshops 2015: 1-10
2000 – 2009
- 2006
- [j7]Fabien Coulon, Mathieu Raffinot:
Fast algorithms for identifying maximal common connected sets of interval graphs. Discret. Appl. Math. 154(12): 1709-1721 (2006) - 2005
- [j6]Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën:
Brute force determinization of nfas by means of state covers. Int. J. Found. Comput. Sci. 16(3): 441-451 (2005) - [j5]Jean-Marc Champarnaud, Fabien Coulon:
Enumerating nondeterministic automata for a given language without constructing the canonical automaton. Int. J. Found. Comput. Sci. 16(6): 1253-1266 (2005) - [j4]Jean-Marc Champarnaud, Fabien Coulon:
Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. Theor. Comput. Sci. 347(1-2): 437-440 (2005) - 2004
- [j3]Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën:
Compact and fast algorithms for safe regular expression search. Int. J. Comput. Math. 81(4): 383-401 (2004) - [j2]Jean-Marc Champarnaud, Fabien Coulon:
NFA reduction algorithms by means of regular inequalities. Theor. Comput. Sci. 327(3): 241-253 (2004) - [c2]Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën:
Brute Force Determinization of NFAs by Means of State Covers. CIAA 2004: 80-89 - 2003
- [j1]Jean-Marc Champarnaud, Fabien Coulon:
Theoretical study and implementation of the canonical automaton. Fundam. Informaticae 55(1): 23-38 (2003) - [c1]Jean-Marc Champarnaud, Fabien Coulon:
NFA Reduction Algorithms by Means of Regular Inequalities. Developments in Language Theory 2003: 194-205
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
