Curriculum Vitae

Formations et diplômes :

2010-2013 : Thèse, Laboratoire d'Informatique Fondamental de Marseille, Aix-Marseille Université.
Équipe modélisation et vérification.

2008-2010 : Master Informatique, Université d'Aix-Marseille II, mention bien (Major).

2005-2008 : Licence Informatique, Université d'Aix-Marseille II, mention bien (Major).

Expériences professionnelles :

2021-... : Professeur informatique, Université du Québec à Montréal (UQÀM), Canada.

2020-2021 : Chercheur, Centre de Recherche Informatique de Montréal (CRIM), Canada.

2015-2020 : Post doctorat, Centre de Recherche Informatique de Montréal (CRIM), Canada.

• Sujet : Automating Change Impact Analysis in Integration and Testing.
• Sujet : Advanced Technology Work Testing and Verification of Machine Learning/AI Based Systems
• Sujet : Industrial-grade Verification & Validation of Evolving Systems

2014-2015 : Post doctorat, IRIT et LAAS-CNRS, Toulouse.

• Sujet : Formal Contracts for a Component-Based Specification Language.

2013-2014 : 1/2 ATER, Laboratoire d'Informatique Fondamental de Marseille, Aix-Marseille Université.

• Responsable de l'UE optionnelle Projet programmation orientée objet.
  Licence 3, 18 étudiants.
• Chargé de TP pour l’UE Complexité.
  Master 1, 60 étudiants.

2010-2013 : Moniteur, Laboratoire d'Informatique Fondamental de Marseille, Aix-Marseille Université.

• Responsable de l'UE optionnelle Projet programmation orientée objet.
  Licence 3, 18 étudiants.
• Chargé de TD et TP pour l'UE Architecture des ordinateurs.
  Licence 2, un groupe de 15 étudiants.
• Chargé de TP pour l'UE Introduction informatique et programmation.
  Licence 1, un groupe 25 étudiants.

Journaux

• DynAMICS: A tool-based method for the specification and dynamic detection of Android behavioural code smells
  
  D. Prestat, N. Moha, R. Villemaire and F. Avellaneda
  IEEE Transactions on Software Engineering, 2024.
• Evaluating trustworthiness of decision tree learning algorithms based on equivalence checking
  
  O. Nguena-Timo, T Xiao, F. Avellaneda, Y. Malik and S. Bruda
  Springer, AI and Ethics, 2024.
• FSM Inference and Checking Sequence Construction are Two Sides of the Same Coin
  
  A. Petrenko and F. Avellaneda
  Software Quality Journal, 2019.
• Catching a structural bug with a flower
  
  F. Avellaneda and R. Morin
  Special Issue from Petri Nets 2014, Fundamenta Informaticae 140, pages 61-87, 2015.

Conférences internationales à comité de lecture

• Delegation-Relegation for Boolean Matrix Factorization
  
  F. Avellaneda, R. Villemaire
  AAAI Conference on Artificial Intelligence 2024 (AAAI 2024). (slides)
• Undercover Boolean Matrix Factorization with MaxSAT
  
  F. Avellaneda, R. Villemaire
  AAAI Conference on Artificial Intelligence 2022 (AAAI 2022). (slides)
• Efficient Inference of Optimal Decision Trees
  
  F. Avellaneda
  AAAI Conference on Artificial Intelligence 2020 (AAAI 2020). (slides)
• Demystifying the Cyber Attribution: An Exploratory Study
  
  F. Jaafar, F. Avellaneda, E.-H. Alikacem
  International Conference on Dependable, Autonomic & Secure Computing 2020 (DASC 2020).
• Using Attack Pattern for Cyber Attack Attribution
  
  F. Avellaneda, E.-H. Alikacem and F. Jaafar
  International Conference on Cybersecurity 2019 (ICoCSec2019).
• Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach
  
  F. Avellaneda, A. Petrenko
  International Conference on Software Engineering and Formal Methods (SEFM 2019).
• Learning and Adaptive Testing of Nondeterministic State Machines
  
  A. Petrenko, F. Avellaneda
  International Conference on Software Quality, Reliability, and Security (QRS 2019).
• Fault Detection in Timed FSM with Timeouts by SAT-Solving
  
  O. Nguena-Timo, D. Prestat, F. Avellaneda
  International Conference on Software Quality, Reliability, and Security (QRS 2019).
• Learning Communicating State Machines
  
  A. Petrenko, F. Avellaneda
  International Conference on Tests and Proofs (TAP 2019).
• Inferring DFA without Negative Examples
  
  F. Avellaneda, A. Petrenko
  International Conference on Grammatical Inference (ICGI 2018). (slides)
• Inference and Conformance Testing of Embedded Components
  
  A. Petrenko, F. Avellaneda
  International Conference on Testing Software and Systems (ICTSS 2018), Springer, p. 119-134.
• FSM Inference from Long Traces
  
  F. Avellaneda, A. Petrenko
  International Symposium on Formal Methods (FM 2018), Springer, p. 93-109.(slides)
• From Passive to Active FSM Inference via Checking Sequence Construction
  
  A. Petrenko, F. Avellaneda, R. Groz, C. Oriat
  International Conference on Testing Software and Systems (ICTSS 2017), Springer, p. 126-141.
• Solving Language Equations using Flanked Automata
  
  F. Avellaneda, S. Dal Zilio, J.-B. Raclet
  International Symposium on Automated Technology for Verification and Analysis (ATVA 2016), Springer, p. 106-121.
• Exhibition of a structural bug with wings
  
  F. Avellaneda and R. Morin
  International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2014), Springer, p. 253-272. (slides)
• Checking partial-order properties of vector addition systems with states
  
  F. Avellaneda and R. Morin
  Application of Concurrency to System Design (ACSD 2013), IEEE, p. 100-109. (slides)
• Checking non-divergence, channel-bound and global cooperation using SAT-solvers
  
  F. Avellaneda and R. Morin
  Application of Concurrency to System Design (ACSD 2011), IEEE, p. 19-28. (slides)

Rapports techniques :

• A Short Description of the Solver EvalMaxSAT
  
  F. Avellaneda
  MaxSAT Evaluation 2020 (MSE 2020).
• Fault Detection for Timed FSM with Timeouts by Constraint Solving
  
  O. Nguena-Timo, D. Prestat and F. Avellaneda
  arXiv preprint.
• Vector addition systems with states vs. Petri nets
  
  F. Avellaneda and R. Morin
  Technical report, Laboratoire d’informatique Fondamentale de Marseille - LIF
• Model-checking bounded vector addition systems with states.
  
  F. Avellaneda and R. Morin
  Technical report, Laboratoire d'informatique Fondamentale de Marseille - LIF

Programmes :

• EvalMaxSAT
  Solveur MaxSAT, classé second à la compétition MaxSAT Evaluation 2020, Track: "complete tack unweighted"
• InferDT
  Prototype pour l'inférence d'arbres de décision optimaux
• VaChe
  Prototype toolbox for VASS under the process semantics

Thèse :

• Vérification de réseaux de Petri avec états sous une sémantique d’ordres partiels.