Florent Avellaneda

32 papers A* 4B 4C 4Journal 13Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
Designing FSMs Specifications from Requirements with GPT 4.0.
CoRR
Omer Nguena Timo, Paul-Alexis Rodriguez, Florent Avellaneda
2026 — conf
On RBAC Maintenance for Preserving Confidentiality.
ICISSP (2)
Franck Arnaud Fotso Kuate, Omer Nguena Timo, Florent Avellaneda
2025 J jnl
AI-Specific Code Smells: From Specification to Detection.
CoRR
Brahim Mahmoudi, Naouel Moha, Quentin Stievenert, Florent Avellaneda
2025 J jnl
An Automated Grey Literature Extraction Tool for Software Engineering.
CoRR
Houcine Abdelkader Cherief, Brahim Mahmoudi, Zacharie Chenail-Larcher, Naouel Moha, Quentin Stievenert, Florent Avellaneda
2025 A* conf
Learning Optimal Oblique Decision Trees with (Max)SAT.
IJCAI
Florent Avellaneda
2025 J jnl
Specification and Detection of LLM Code Smells.
CoRR
Brahim Mahmoudi, Zacharie Chenail-Larcher, Naouel Moha, Quentin Stiévenart, Florent Avellaneda
2024 A* conf
Delegation-Relegation for Boolean Matrix Factorization.
AAAI
Florent Avellaneda, Roger Villemaire
2024 J jnl
DynAMICS: A Tool-Based Method for the Specification and Dynamic Detection of Android Behavioral Code Smells.
IEEE Trans. Software Eng.
Dimitri Prestat, Naouel Moha, Roger Villemaire, Florent Avellaneda
2024 J jnl
Evaluating trustworthiness of decision tree learning algorithms based on equivalence checking.
AI Ethics
Omer Nguena Timo, Tianqi Xiao, Florent Avellaneda, Yasir Malik, Stefan D. Bruda
2024 — conf
Parametric Automata for Dynamic Access Control Policies.
FPS (1)
Franck Arnaud Fotso Kuate, Florent Avellaneda, Omer Nguena Timo
2022 A* conf
Undercover Boolean Matrix Factorization with MaxSAT.
AAAI
Florent Avellaneda, Roger Villemaire
2021 J jnl
Boolean Matrix Factorization with SAT and MaxSAT.
CoRR
Florent Avellaneda, Roger Villemaire
2020 J jnl
An Approach to Evaluating Learning Algorithms for Decision Trees.
CoRR
Tianqi Xiao, Omer Nguena Timo, Florent Avellaneda, Yasir Malik, Stefan D. Bruda
2020 — conf
Demystifying the Cyber Attribution: An Exploratory Study.
DASC/PiCom/CBDCom/CyberSciTech
Fehmi Jaafar, Florent Avellaneda, El Hachemi Alikacem
2020 A* conf
Efficient Inference of Optimal Decision Trees.
AAAI
Florent Avellaneda
2019 J jnl
FSM inference and checking sequence construction are two sides of the same coin.
Softw. Qual. J.
Alexandre Petrenko, Florent Avellaneda, Roland Groz, Catherine Oriat
2019 C conf
Fault Detection in Timed FSM with Timeouts by SAT-Solving.
QRS
Omer Nguena Timo, Dimitri Prestat, Florent Avellaneda
2019 — conf
Learning Communicating State Machines.
TAP@FM
Alexandre Petrenko, Florent Avellaneda
2019 B conf
Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach.
SEFM
Florent Avellaneda, Alexandre Petrenko
2019 J jnl
Learning Optimal Decision Trees from Large Datasets.
CoRR
Florent Avellaneda
2019 C conf
Learning and Adaptive Testing of Nondeterministic State Machines.
QRS
Alexandre Petrenko, Florent Avellaneda
2018 C conf
Conformance Testing and Inference of Embedded Components.
ICTSS
Alexandre Petrenko, Florent Avellaneda
2018 B conf
FSM Inference from Long Traces.
FM
Florent Avellaneda, Alexandre Petrenko
2018 J jnl
Fault Detection for Timed FSM with Timeouts by Constraint Solving.
CoRR
Omer Nguena Timo, Dimitri Prestat, Florent Avellaneda
2018 — conf
Inferring DFA without Negative Examples.
ICGI
Florent Avellaneda, Alexandre Petrenko
2017 C conf
From Passive to Active FSM Inference via Checking Sequence Construction.
ICTSS
Alexandre Petrenko, Florent Avellaneda, Roland Groz, Catherine Oriat
2016 B conf
Solving Language Equations Using Flanked Automata.
ATVA
Florent Avellaneda, Silvano Dal-Zilio, Jean-Baptiste Raclet
2015 J jnl
Catching a Structural Bug with a Flower.
Fundam. Informaticae
Florent Avellaneda, Rémi Morin
2015 J jnl
On the Complexity of Flanked Finite State Automata.
CoRR
Florent Avellaneda, Silvano Dal-Zilio, Jean-Baptiste Raclet
2014 B conf
Exhibition of a Structural Bug with Wings.
Petri Nets
Florent Avellaneda, Rémi Morin
2013 — conf
Checking Partial-Order Properties of Vector Addition Systems with States.
ACSD
Florent Avellaneda, Rémi Morin
2011 — conf
Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers.
ACSD
Florent Avellaneda, Rémi Morin