Complexity | Umang Mathur

Counting and Sampling Traces in Regular Languages

Predictive Monitoring with Strong Trace Prefixes

Predictive Monitoring against Pattern Regular Languages

Note: The ArXiv version of the paper corrects an error in the published version.

Coarser Equivalences for Causal Concurrency

How Hard is Weak-Memory Testing?

Dynamic Data-Race Detection through the Fine-Grained Lens

Decidable Synthesis of Programs with Uninterpreted Functions

Weak Singular Hybrid Automata