Ing. Petra Ritschelová

2024 - 2026

The emerging theory of game comonads establishes a fruitful interplay between category theory, mathematical logic, and algorithms. This theory has shown its power when obtaining new Lovasz-type theorems, preservation theorems and decomposition theorems in finite model theory. In our recent work we show that the theory of game comonads can be leveraged to obtain the two traditional Courcelle theorems, stating FPT decidability of monadic second order logic on classes of bounded tree-width and clique-width. This result is only a first step in concrete algorithmic applications of the theory. The abstract setting of game comonads is a good candidate for a systematic treatment of algorithmic problems. The first objective of the project is to formulate a general theory of FPT decidability in terms of game comonads. To start with, we describe some of the important model-theoretic algorithms.

2019 - 2022

The project aims to create at the FIT CTU the Institute of Scalable Code Analytics (ISCA), the first research centre in the CR focused on analyses of large code bases available on the Internet. Software systems are written in source code; BigCode refers to the massive codebases on the Internet. Combining techniques from programming languages and statistical machine learning will allow the mining of these codebases for crucial insights. The requested funds will be invested, in part, to provide the FIT with the first hardware and software infrastructure for big code data analysis. The other part of the research funding will attract internationally renowned researchers in the field of computer languages. The team is synergistic with existing research capacities at the FIT in software and knowledge engineering, data mining and parallel computing. The new team is well connected internationally and will bring investment from leading industrial partners that include Google and Oracle.

2016 - 2022

The Evolving Language Ecosystems project explores the fundamental techniques and algorithms for evolving programming languages and their ecosystems. Our purpose is to reduce the cost of wide-ranging language changes and obviate the need for devising entirely new languages. Our findings will grant both researchers and practitioners a greater degree of freedom when experimenting with new ideas on how to express computation.

2024 - 2026

PoliRuralPlus