ERC Starting Grant · 2022
Finite-state abstractions of infinite-state systems
The algorithmic analysis of infinite-state systems is a central topic of theoretical computer science that is part of a popular approach to software verification. While analyzing infinite-state systems is indispensable when verifying software, finite-state sytems are far better understood and permit much more efficient analysis. In this project, I will pursue fundamental questions that arise when we want to abstract infinite-state systems by finite-state systems. The goal is to understand two types of problems: 1. Separability problems: Given two infinite-state systems, can we find a finite-state overapproximation of the first system whose behaviors are disjoint from those of the second…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.