Gabriele Puppis

Interests
  • Automata theory
  • Logics
  • Databases
  • Algebra

Short bio
  • MSc in CS, Udine University, Italy (2002)
  • PhD in CS, Udine University, Italy (2006)
  • Postdoc, Udine University, Italy (2006-2008)
  • Postdoc, Oxford University, UK (2009-2012)
  • Junior Research Fellowship, Linacre College Oxford, UK (2010-2012)
  • CNRS researcher at LaBRI, France (2012-now)


Professional activities
  • TIME 2014 (21st International Symposium on Temporal Representation and Reasoning), PC member
  • PODS 2014 (33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems), PC member
  • GandALF 2013 (4th International Symposium on Games, Automata, Logics and Formal Verification), co-chair
  • WoLLIC 2013 (20th Workshop on Logic, Language, Information and Computation), PC member
  • GandALF 2012 (3rd International Symposium on Games, Automata, Logics and Formal Verification), PC member
  • GandALF 2011 (2nd International Symposium on Games, Automata, Logics and Formal Verification), PC member
  • GandALF 2010 (1st International Symposium on Games, Automata, Logics and Formal Verification), PC member


Selected publications  (View all)
  • Conference paper with A. Manuel and A. Muscholl
    Walking on Data Words
    In Proceedings of the 8th International Computer Science Symposium in Russia (CSR)
    pages 64-75, Springer
    PdfBibtex
  • Conference paper with C. Riveros and S. Staworko
    Bounded Repairability for Regular Tree Languages
    In Proceedings of the 15th International Conference on Database Theory (ICDT)
    pages 155-168, ACM
    PdfBibtexSlides
  • Conference paper with T. Colcombet and C. Ley
    On the Use of Guards for Logics with Data
    In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS)
    LNCS, volume 6907, pages 243-255, Springer
    PdfBibtexSlides
  • Conference paper with O. Carton and T. Colcombet
    Regular Languages of Words over Countable Linear Orderings
    In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP)
    LNCS, volume 6756, pages 125-136, Springer
    PdfBibtex