research
∙
10/27/2022
Existential Definability over the Subword Ordering
We study first-order logic (FO) over the structure consisting of finite ...
share
research
∙
11/17/2021
Context-Bounded Verification of Thread Pools
Thread pooling is a common programming idiom in which a fixed set of wor...
research
∙
01/21/2021
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
The model of asynchronous programming arises in many contexts, from low-...
research
∙
11/11/2020
The complexity of bounded context switching with dynamic thread creation
Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical...
research
∙
11/09/2020
Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs
We study context-bounded verification of liveness properties of multi-th...
research
∙
08/12/2019
Regular Separability and Intersection Emptiness are Independent Problems
The problem of regular separability asks, given two languages K and L, w...
research
∙
09/10/2017