Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorent Avellaneda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Florent Avellaneda, Roger Villemaire:
Undercover Boolean Matrix Factorization with MaxSAT. AAAI 2022: 3672-3681- [d1]Dimitri Prestat, Naouel Moha, Roger Villemaire, Florent Avellaneda:
DynAMICS: A tool-based method for the specification and dynamic detection of Android behavioural code smells. IEEE DataPort 2022 - 2021
- [i5]Florent Avellaneda, Roger Villemaire:
Boolean Matrix Factorization with SAT and MaxSAT. CoRR abs/2106.10105 (2021) - 2020
- [c14]Florent Avellaneda:
Efficient Inference of Optimal Decision Trees. AAAI 2020: 3195-3202 - [c13]Fehmi Jaafar, Florent Avellaneda, El Hachemi Alikacem:
Demystifying the Cyber Attribution: An Exploratory Study. DASC/PiCom/CBDCom/CyberSciTech 2020: 35-40 - [i4]Tianqi Xiao, Omer Nguena Timo, Florent Avellaneda, Yasir Malik, Stefan D. Bruda:
An Approach to Evaluating Learning Algorithms for Decision Trees. CoRR abs/2010.13665 (2020)
2010 – 2019
- 2019
- [j2]Alexandre Petrenko
, Florent Avellaneda, Roland Groz, Catherine Oriat:
FSM inference and checking sequence construction are two sides of the same coin. Softw. Qual. J. 27(2): 651-674 (2019) - [c12]Omer Nguena Timo, Dimitri Prestat, Florent Avellaneda:
Fault Detection in Timed FSM with Timeouts by SAT-Solving. QRS 2019: 326-333 - [c11]Alexandre Petrenko, Florent Avellaneda:
Learning and Adaptive Testing of Nondeterministic State Machines. QRS 2019: 362-373 - [c10]Florent Avellaneda, Alexandre Petrenko:
Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach. SEFM 2019: 243-256 - [c9]Alexandre Petrenko, Florent Avellaneda:
Learning Communicating State Machines. TAP@FM 2019: 112-128 - [i3]Florent Avellaneda:
Learning Optimal Decision Trees from Large Datasets. CoRR abs/1904.06314 (2019) - 2018
- [c8]Florent Avellaneda, Alexandre Petrenko:
FSM Inference from Long Traces. FM 2018: 93-109 - [c7]Florent Avellaneda, Alexandre Petrenko:
Inferring DFA without Negative Examples. ICGI 2018: 17-29 - [c6]Alexandre Petrenko, Florent Avellaneda:
Conformance Testing and Inference of Embedded Components. ICTSS 2018: 119-134 - [i2]Omer Nguena Timo, Dimitri Prestat, Florent Avellaneda:
Fault Detection for Timed FSM with Timeouts by Constraint Solving. CoRR abs/1811.11119 (2018) - 2017
- [c5]Alexandre Petrenko, Florent Avellaneda, Roland Groz, Catherine Oriat:
From Passive to Active FSM Inference via Checking Sequence Construction. ICTSS 2017: 126-141 - 2016
- [c4]Florent Avellaneda, Silvano Dal-Zilio, Jean-Baptiste Raclet:
Solving Language Equations Using Flanked Automata. ATVA 2016: 106-121 - 2015
- [j1]Florent Avellaneda, Rémi Morin:
Catching a Structural Bug with a Flower. Fundam. Informaticae 140(1): 61-87 (2015) - [i1]Florent Avellaneda, Silvano Dal-Zilio, Jean-Baptiste Raclet:
On the Complexity of Flanked Finite State Automata. CoRR abs/1509.06501 (2015) - 2014
- [c3]Florent Avellaneda, Rémi Morin:
Exhibition of a Structural Bug with Wings. Petri Nets 2014: 253-272 - 2013
- [c2]Florent Avellaneda, Rémi Morin:
Checking Partial-Order Properties of Vector Addition Systems with States. ACSD 2013: 100-109 - 2011
- [c1]Florent Avellaneda, Rémi Morin:
Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers. ACSD 2011: 19-28
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-26 01:57 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:
