111 citations · 528 across the 50 of their papers we have counts for
8 papers · 1 filter
Generators and Bases for Monadic Closures
Stefan Zetzsche, Alexandra Silva, Matteo Sammartino
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more…
Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers
Lunjia Hu, Omer Reingold
We study the problem of robustly estimating the mean of a -dimensional distribution given examples, where most coordinates of every example may be missing and $\varepsilon N…
Partially Observable Concurrent Kleene Algebra
Jana Wagemaker, Paul Brunet, Simon Docherty +3
We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and lo…
Minimisation in Logical Form
Nick Bezhanishvili, Marcello Bonsangue, Helle Hvid Hansen +4
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation…
Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness
Tobias Kappé, Paul Brunet, Alexandra Silva +2
Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs. However, CKA fundamentally mis…
Actor-Based Model Checking for SDN Networks
Elvira Albert, Miguel Gómez-Zamalloa, Miguel Isabel +3
Software-Defined Networking (SDN) is a networking paradigm that has become increasingly popular in the last decade. The unprecedented control over the global behavior of the networ…