111 citations · 528 across the 50 of their papers we have counts for
8 papers · 1 filter
Layer by layer - Combining Monads
Fredrik Dahlqvist, Louis Parlant, Alexandra Silva
We develop a method to incrementally construct programming languages. Our approach is categorical: each layer of the language is described as a monad. Our method either (i) concret…
Concurrent Kleene Algebra: Free Model and Completeness
Tobias Kappé, Paul Brunet, Alexandra Silva +1
Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the axioms for CKA wi…
Probabilistic Program Equivalence for NetKAT
Steffen Smolka, Praveen Kumar, Nate Foster +4
We tackle the problem of deciding whether two probabilistic programs are equivalent in Probabilistic NetKAT, a formal language for specifying and reasoning about the behavior of pa…
Distribution Bisimilarity via the Power of Convex Algebras
Filippo Bonchi, Alexandra Silva, Ana Sokolova
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics…
Conditional Transition Systems with Upgrades
Harsh Beohar, Barbara König, Sebastian Küpper +1
We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional tra…
Optimizing Automata Learning via Monads
Gerco van Heerdt, Matteo Sammartino, Alexandra Silva
Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence opt…