Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers. - Florent Avellaneda; Rémi Morin (ACSD, 2011)

Checking Partial-Order Properties of Vector Addition Systems with States. - Florent Avellaneda; Rémi Morin (ACSD, 2013)

Exhibition of a Structural Bug with Wings. - Florent Avellaneda; Rémi Morin (Petri Nets, 2014)

On the Complexity of Flanked Finite State Automata. - Florent Avellaneda; Silvano Dal-Zilio; Jean-Baptiste Raclet (CoRR, 2015)

Catching a Structural Bug with a Flower. - Florent Avellaneda; Rémi Morin (Fundam. Informaticae, 2015)

Solving Language Equations Using Flanked Automata. - Florent Avellaneda; Silvano Dal-Zilio; Jean-Baptiste Raclet (ATVA, 2016)

From Passive to Active FSM Inference via Checking Sequence Construction. - Alexandre Petrenko; Florent Avellaneda; Roland Groz; Catherine Oriat (ICTSS, 2017)

FSM Inference from Long Traces. - Florent Avellaneda; Alexandre Petrenko (FM, 2018)

Inferring DFA without Negative Examples. - Florent Avellaneda; Alexandre Petrenko (ICGI, 2018)

Conformance Testing and Inference of Embedded Components. - Alexandre Petrenko; Florent Avellaneda (ICTSS, 2018)

Fault Detection for Timed FSM with Timeouts by Constraint Solving. - Omer Nguena Timo; Dimitri Prestat; Florent Avellaneda (CoRR, 2018)

Learning and Adaptive Testing of Nondeterministic State Machines. - Alexandre Petrenko; Florent Avellaneda (QRS, 2019)

Fault Detection in Timed FSM with Timeouts by SAT-Solving. - Omer Nguena Timo; Dimitri Prestat; Florent Avellaneda (QRS, 2019)

Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach. - Florent Avellaneda; Alexandre Petrenko (SEFM, 2019)

Learning Communicating State Machines. - Alexandre Petrenko; Florent Avellaneda (TAP@FM, 2019)

Learning Optimal Decision Trees from Large Datasets. - Florent Avellaneda (CoRR, 2019)

FSM inference and checking sequence construction are two sides of the same coin. - Alexandre Petrenko; Florent Avellaneda; Roland Groz; Catherine Oriat (Softw. Qual. J., 2019)

Efficient Inference of Optimal Decision Trees. - Florent Avellaneda (AAAI, 2020)

Demystifying the Cyber Attribution: An Exploratory Study. - Fehmi Jaafar; Florent Avellaneda; El Hachemi Alikacem (DASC/PiCom/CBDCom/CyberSciTech, 2020)

An Approach to Evaluating Learning Algorithms for Decision Trees. - Tianqi Xiao; Omer Nguena Timo; Florent Avellaneda; Yasir Malik; Stefan D. Bruda (CoRR, 2020)

Boolean Matrix Factorization with SAT and MaxSAT. - Florent Avellaneda; Roger Villemaire (CoRR, 2021)

Undercover Boolean Matrix Factorization with MaxSAT. - Florent Avellaneda; Roger Villemaire (AAAI, 2022)

DynAMICS: A tool-based method for the specification and dynamic detection of Android behavioural code smells. - Dimitri Prestat; Naouel Moha; Roger Villemaire; Florent Avellaneda (IEEE DataPort, 2022)

Delegation-Relegation for Boolean Matrix Factorization. - Florent Avellaneda; Roger Villemaire (AAAI, 2024)

Parametric Automata for Dynamic Access Control Policies. - Franck Fotso Kuate; Florent Avellaneda; Omer Nguena Timo (FPS (1), 2024)

Evaluating trustworthiness of decision tree learning algorithms based on equivalence checking. - Omer Nguena Timo; Tianqi Xiao; Florent Avellaneda; Yasir Malik; Stefan D. Bruda (AI Ethics, 2024)

DynAMICS: A Tool-Based Method for the Specification and Dynamic Detection of Android Behavioral Code Smells. - Dimitri Prestat; Naouel Moha; Roger Villemaire; Florent Avellaneda (IEEE Trans. Software Eng., 2024)