Search Results for author:
Found 15 papers, 6 papers with code
Proceedings of the 11th workshop on Quantum Physics and Logic
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).
Lattice-Theoretic Progress Measures and Coalgebraic Model Checking (with Appendices)
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
Causality-Aided Falsification
Falsification is drawing attention in quality assurance of heterogeneous systems whose complexities are beyond most verification techniques' scalability.
Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments
To this goal, we devise a theory of supermartingales that overapproximate higher moments of runtime.
Logic in Computer Science
Fast Falsification of Hybrid Systems using Probabilistically Adaptive Input
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
Offline timed pattern matching under uncertainty
Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log.
Systems and Control Logic in Computer Science F.4
Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces
We present a method to extract a weighted finite automaton (WFA) from a recurrent neural network (RNN).
Symbolic Monitoring against Specifications Parametric in Time and Data
Monitoring consists in deciding whether a log meets a given specification.
Formal Languages and Automata Theory Systems and Control
Genetic Algorithm for the Weight Maximization Problem on Weighted Automata
In this work, we propose, implement and evaluate a metaheuristic based on genetic algorithms to approximate solutions to the WMP.
Predictive PER: Balancing Priority and Diversity towards Stable Deep Reinforcement Learning
Prioritized experience replay (PER) samples important transitions, rather than uniformly, to improve the performance of a deep reinforcement learning agent.
Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs
We present a novel sampling framework for probabilistic programs.
Model-bounded monitoring of hybrid systems
Monitoring of hybrid systems attracts both scientific and practical attention.
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down
The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science.
Dynamic Shielding for Reinforcement Learning in Black-Box Environments
The dynamic shielding technique constructs an approximate system model in parallel with RL using a variant of the RPNI algorithm and suppresses undesired explorations due to the shield constructed from the learned model.
Online Causation Monitoring of Signal Temporal Logic
The classic STL monitoring is performed by computing a robustness interval that specifies, at each instant, how far the monitored signals are from violating and satisfying the specification.
