The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science.
We introduce a novel sampling algorithm for Bayesian inference on imperative probabilistic programs.
Prioritized experience replay (PER) samples important transitions, rather than uniformly, to improve the performance of a deep reinforcement learning agent.
In this work, we propose, implement and evaluate a metaheuristic based on genetic algorithms to approximate solutions to the WMP.
Monitoring consists in deciding whether a log meets a given specification.
Formal Languages and Automata Theory Systems and Control
We present a method to extract a weighted finite automaton (WFA) from a recurrent neural network (RNN).
We present an algorithm that quickly finds falsifying inputs for hybrid systems, i. e., inputs that steer the system towards violation of a given temporal logic requirement.
Systems and Control
To this goal, we devise a theory of supermartingales that overapproximate higher moments of runtime.
Logic in Computer Science
In the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then solved by the seminal algorithm by Jurdzinski.
Logic in Computer Science Programming Languages
The first QPL under the new name Quantum Physics and Logic was held in Reykjavik (2008), followed by Oxford (2009 and 2010), Nijmegen (2011), Brussels (2012) and Barcelona (2013).