Back
  1. Home
  2. Profile of Axel Haddad (UMONS)
Profil

Haddad Axel

Main Referenced Co-authors
BRIHAYE, Thomas  (4)
Geeraerts, Gilles (3)
Monmege, Benjamin (3)
Carayol, Arnaud (2)
Serre, Olivier (2)
Main Referenced Keywords
higher-order recursion schemes (3); Markov Decision Processes (2); Model-checking (2); Partial observation (2); Probabilities (2);
Main Referenced Unit & Research Centers
CREMMI - Modélisation mathématique et informatique (9)
Main Referenced Disciplines
Electrical & electronics engineering (9)

Publications (total 9)

The most downloaded
5 downloads
Haddad, A. (2013). Model Checking and Functional Program Transformations [Paper presentation]. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, Guwahati, India. doi:10.4230/LIPIcs.FSTTCS.2013.115 https://hdl.handle.net/20.500.12907/15976

The most cited

20 citations (OpenAlex)

Carayol, A., Haddad, A., & Serre, O. (01 August 2014). Randomization in Automata on Infinite Trees. ACM Transactions on Computational Logic, 15 (3), 1-33. doi:10.1145/2629336 https://hdl.handle.net/20.500.12907/33511

Brihaye, T., Geeraerts, G., Haddad, A., Lefaucheux, E., & Monmege, B. (2015). Simple Priced Timed Games Are Not That Simple [Paper presentation]. Foundations of Software Technology and Theoretical Computer Science, Bangalore, India.

Brihaye, T., Geeraerts, G., Haddad, A., Monmege, B., Pérez, G., & Renault, G. (2015). Quantitative Games under Failures [Paper presentation]. Foundations of Software Technology and Theoretical Computer Science, Bangalore, India.

Brihaye, T., Haddad, A., & Menet, Q. (2015). Simple strategies for Banach-Mazur games and sets of probability 1. Information and Computation.
Peer Reviewed verified by ORBi

Brihaye, T., Geeraerts, G., Haddad, A., & Monmege, B. (2015). To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games [Paper presentation]. International Conference on Concurrency Theory, Madrid, Spain.

Carayol, A., Haddad, A., & Serre, O. (01 August 2014). Randomization in Automata on Infinite Trees. ACM Transactions on Computational Logic, 15 (3), 1-33. doi:10.1145/2629336
Peer Reviewed verified by ORBi

Haddad, A. (2013). Model Checking and Functional Program Transformations [Paper presentation]. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, Guwahati, India. doi:10.4230/LIPIcs.FSTTCS.2013.115

Haddad, A. (2013). Shape-Preserving Transformations of Higher-Order Recursion Schemes [Doctoral thesis, Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/4215

Haddad, A. (2012). IO vs OI in Higher-Order Recursion Schemes [Paper presentation]. 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonia. doi:10.4204/EPTCS.77.4

Carayol, A., Haddad, A., & Serre, O. (2011). Qualitative Tree Languages [Paper presentation]. 26th Annual IEEE Symposium on Logic in Computer Science, LICS, Toronto, Canada. doi:10.1109/LICS.2011.28

Contact ORBi UMONS