Daniele Dell'Erba

My research focus on theoretical computer science, precisely the field of formal verification. The majority of the effort aim at solving infinite-duration games on graphs which can be used for the model checking and synthesis of hardware and software systems.

In the last years I dedicated my time mainly in finding more efficient solution algorithms for parity games and mean-payoff games, developing a technique called Priority Promotion approach that relies on the notion of quasi dominion. Currently I am pursuing the idea of applying such approach in a broader context of games on graphs, for instance to discounted mean-payoff and stochastic games.

I am also investigating the fundamental connections and differences between the types of infinite-duration games, considering reductions that go back in the chain of standard reductions, as well as connecting the algorithmic advances between the algorithms that solve these games.