Florent Avellaneda

Orcid: 0000-0003-1030-5388

According to our database1, Florent Avellaneda authored at least 26 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
DynAMICS: A Tool-Based Method for the Specification and Dynamic Detection of Android Behavioral Code Smells.
IEEE Trans. Software Eng., April, 2024

Evaluating trustworthiness of decision tree learning algorithms based on equivalence checking.
AI Ethics, February, 2024

Delegation-Relegation for Boolean Matrix Factorization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2022
DynAMICS: A tool-based method for the specification and dynamic detection of Android behavioural code smells.
Dataset, December, 2022

Undercover Boolean Matrix Factorization with MaxSAT.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Boolean Matrix Factorization with SAT and MaxSAT.
CoRR, 2021

2020
An Approach to Evaluating Learning Algorithms for Decision Trees.
CoRR, 2020

Demystifying the Cyber Attribution: An Exploratory Study.
Proceedings of the IEEE Intl Conf on Dependable, 2020

Efficient Inference of Optimal Decision Trees.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
FSM inference and checking sequence construction are two sides of the same coin.
Softw. Qual. J., 2019

Learning Optimal Decision Trees from Large Datasets.
CoRR, 2019

Learning Communicating State Machines.
Proceedings of the Tests and Proofs - 13th International Conference, 2019

Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach.
Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

Fault Detection in Timed FSM with Timeouts by SAT-Solving.
Proceedings of the 19th IEEE International Conference on Software Quality, 2019

Learning and Adaptive Testing of Nondeterministic State Machines.
Proceedings of the 19th IEEE International Conference on Software Quality, 2019

2018
Fault Detection for Timed FSM with Timeouts by Constraint Solving.
CoRR, 2018

Conformance Testing and Inference of Embedded Components.
Proceedings of the Testing Software and Systems, 2018

Inferring DFA without Negative Examples.
Proceedings of the 14th International Conference on Grammatical Inference, 2018

FSM Inference from Long Traces.
Proceedings of the Formal Methods - 22nd International Symposium, 2018

2017
From Passive to Active FSM Inference via Checking Sequence Construction.
Proceedings of the Testing Software and Systems, 2017

2016
Solving Language Equations Using Flanked Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
Catching a Structural Bug with a Flower.
Fundam. Informaticae, 2015

On the Complexity of Flanked Finite State Automata.
CoRR, 2015

2014
Exhibition of a Structural Bug with Wings.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Checking Partial-Order Properties of Vector Addition Systems with States.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2011
Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011


  Loading...