School of Computing

Hugo Feree

Research Associate

Photo of H Feree, if available
  • Tel:     +44 (0)1227 823823
  • Fax:     +44 (0)1227 762811
  • Email:
  • Room SW12
    School of Computing
    University of Kent,
    CT2 7NF

Research Interests

I belong to the following research groups:

Trustworthy Refactoring

I am currently involved in the Trustworthy refactoring project with Simon Thompson, Scott Owens and Reuben Rowe. It aims at producing a refactoring tool for OCaml programs, where the preservation of the semantics is formally verified using the HOL theorem prover, through the use of the CakeML project.

About Me

Previous positions

2015—2016 Temporary teaching (Université Lille 3) and reaserch position (ATER), in the research team 2XS of the CRIStAL lab.
2015—2015 Visiting postdoc in the Logik group at TU Darmstadt (January — June)
2011—2014 PhD student (LORIA lab). I defended my PhD [TEL(fr)] 10/12/2014 at Loria, advised by Jean-Yves Marion and Mathieu Hoyrup.
2012—2014 Teaching assistant, Faculté des Sciences et Technologies de Nancy, Université de Lorraine

Publications

Ongoing/submitted

  • Game semantics approach to higher order complexity [PDF]
    Hugo Férée

Articles

  • Characterizing polynomial time complexity of stream programs using interpretations
    Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
    Theoretical Computer Science 2015 [HAL]
  • Analytical properties of resource-bounded real functionals
    Hugo Férée, Walid Gomaa, Mathieu Hoyrup
    Journal of Complexity 2014 [HAL]

Conferences

  • On the Computational Complexity of Positive Linear Functionals on C[0;1]
    Hugo Férée, and Martin Ziegler
    MACIS 2015 [PDF]
  • On the Computational Complexity of Positive Linear Functionals on C[0;1]
    Hugo Férée, and Martin Ziegler
    CCA 2015 (abstract of MACIS 2015, above)
  • On the query complexity of real functionals
    Hugo Férée, Walid Gomaa and Mathieu Hoyrup
    LICS 2013 [HAL]
  • Higher-order complexity in analysis
    Hugo Férée and Mathieu Hoyrup
    CCA 2013 [HAL]
  • Interpretation of stream programs: characterizing type 2 polynomial time complexity
    Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup and Romain Péchoux
    ISAAC 2010 [HAL]

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 29/06/2017