
HigherOrder Model Checking Step by Step
We show a new simple algorithm that solves the modelchecking problem fo...
read it

A Recursive Approach to Solving Parity Games in Quasipolynomial Time
Zielonka's classic recursive algorithm for solving parity games is perha...
read it

Bisimulation Finiteness of Pushdown Systems Is Elementary
We show that in case a pushdown system is bisimulation equivalent to a f...
read it

Compositionality of the MSO+U Logic
We prove that the MSO+U logic is compositional in the following sense: w...
read it

Intersection Types for Unboundedness Problems
Intersection types have been originally developed as an extension of sim...
read it

Recursion Schemes, the MSO Logic, and the U quantifier
We study the modelchecking problem for recursion schemes: does the tree...
read it

Universal trees grow inside separating automata: Quasipolynomial lower bounds for parity games
Several distinct techniques have been proposed to design quasipolynomia...
read it
Paweł Parys
is this you? claim profile