Theoretical Computer Science
Home Mission Research Teaching Software Events Projects Vacancies Former Members
Category
All Publications Lectures Projects Academic Achievements
Year
2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004

Publications 2019

Contributions to Books / Journals

Proceedings Article (Full Paper)
  • Avanzini, Martin; Dal Lago, Ugo; Moser, Georg (2019): Higher-Order Complexity Analysis With First-Order Tools.
    In: Ayala-Rincón, Mauricio; Ghilezan, Silvia; Grue Simonsen, Jakob: Joint Proceedings of HOR 2019 and IWC 2019. (with system descriptions from CoCo 2019). Manchester: EasyChair., pp. 6 - 10. (Web link)

  • Avanzini, Martin; Schaper, Michael; Moser, Georg (2019): Modular Runtime Complexity Analysis of Probabilistic While Programs.
    In: Papers of DICE-FOPARA 2019 Workshop on Developments in Implicit Computational complExity & Foundational & Practical Aspects of Resource Analysis. 6-7 April, 2019. München: Ludwig-Maximlians-Universität München., online. (Web link)

Proceedings Article (Abstract)
  • Moser, Georg; Winkler, Sarah (2019): Smarter Features, Simpler Learning?
    In: ARCADE 2019. Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements. 26 August 2019, Natal, Brasil. New York: ACM Digital Library., online. (Web link)

Lectures 2019

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)
  • Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg; Dal Lago, Ugo: Higher-Order Complexity Analysis With First-Order Tools.
    10th International Workshop on Higher-Order Rewriting (HOR 2019), Dortmund, 2019-06-28. (Web link)

  • Lecturer(s): Moser, Georg: Hibert's epsilon calculus with equality and Herbrand complexity.
    Workshop on Proof Theory, Modal Logic and Reflection Principles (WORMSHOP 2019), Barcelona, 2019-11-08. (Web link)

Conference Lecture (Upon Registration)
  • Lecturer(s): Avanzini, Martin Co-author(s): Schaper, Michael; Moser, Georg: Modular Runtime Complexity Analysis of Probabilistic While Programs.
    Workshop on Developments in Implicit Computational complExity & Foundational & Practical Aspects of Resource Analysis (DICE-FOPARA 2019), Prag, 2019-04-07. (Web link)

  • Lecturer(s): Moser, Georg: Higher-order Complexity Theory and its Applications.
    Shonan Meeting 151: Higher-order Complexity Theory and its Applications, Tokio, 2019-10-08. (Web link)

  • Lecturer(s): Winkler, Sarah Co-author(s): Moser, Georg: Smarter Features, Simpler Learning?
    2nd International ARCADE (Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements) Workshop, Natal, 2019-08-26. (Web link)

Projects, scholarships and other third-party funds 2019

Research Projects

  • Moser, Georg: Proof theory for branching quantifiers: CERES and beyond.
    Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Einzelprojekt
    2018-01-01 - 2021-04-30

  • Moser, Georg: FISP. The Fine structure of proof systems and its computational interpretations.
    Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Joint Projects
    2016-01-01 - 2019-06-30

  • Winkler, Sarah; Moser, Georg: Instantiation- and Learning-Based Methods in Equational Reasoning.
    Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Hertha-Firnberg-Programm
    2016-10-01 - 2019-09-30

Academic Activities and Achievements 2019

Supervision of Student Theses

  • Moser, Georg: Maringele, Alexander: Instantiation-based First-Order Theorem Proving with Equality (2015 - 2023).

  • Netzer, Tim; De Las Cuevas Millan, Gemma; Moser, Georg: Abbasi, Paria: Approximation techniques for positive matrices (2019 - 2022).