13 citations · 26 across the 12 of their papers we have counts for
14 papers
FairMon: A Tool for Monitoring and Visualizing Algorithmic Fairness
Jan Baumeister, Bernd Finkbeiner, Vladimir Krsmanovic +3
Runtime monitoring has recently been proposed as a rigorous method for analyzing algorithmic fairness of autonomous decision systems used in critical scenarios such as credit lendi…
Natural Synthesis: Outperforming Reactive Synthesis Tools with Large Reasoning Models
Frederik Schmitt, Matthias Cosler, Niklas Metzger +4
Reactive synthesis, the problem of automatically constructing a hardware circuit from a logical specification, is a long-standing challenge in formal verification. It is elusive fo…
Explainability Requirements as Hyperproperties
Bernd Finkbeiner, Julian Siber
Explainability is emerging as a key requirement for autonomous systems. While many works have focused on what constitutes a valid explanation, few have considered formalizing expla…
An Information-Flow Perspective on Explainability Requirements: Specification and Verification
Bernd Finkbeiner, Hadar Frenkel, Julian Siber
Explainable systems expose information about why certain observed effects are happening to the agents interacting with them. We argue that this constitutes a positive flow of infor…
Closure and Complexity of Temporal Causality
Mishel Carelli, Bernd Finkbeiner, Julian Siber
Temporal causality defines what property causes some observed temporal behavior (the effect) in a given computation, based on a counterfactual analysis of similar computations. In…
Stream-Based Monitoring of Algorithmic Fairness
Jan Baumeister, Bernd Finkbeiner, Frederik Scheerer +2
Automatic decision and prediction systems are increasingly deployed in applications where they significantly impact the livelihood of people, such as for predicting the creditworth…
Counterfactual Explanations for MITL Violations
Bernd Finkbeiner, Felix Jahn, Julian Siber
MITL is a temporal logic that facilitates the verification of real-time systems by expressing the critical timing constraints placed on these systems. MITL specifications can be ch…
Synthesis of Temporal Causality
Bernd Finkbeiner, Hadar Frenkel, Niklas Metzger +1
We present an automata-based algorithm to synthesize omega-regular causes for omega-regular effects on executions of a reactive system, such as counterexamples uncovered by a model…
Learning Better Representations From Less Data For Propositional Satisfiability
Mohamed Ghanem, Frederik Schmitt, Julian Siber +1
Training neural networks on NP-complete problems typically demands very large amounts of training data and often needs to be coupled with computationally expensive symbolic verifie…
Counterfactuals Modulo Temporal Logics
Bernd Finkbeiner, Julian Siber
Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality. In this paper, we extend this theory in the temporal direction to enable symbolic coun…
Explaining Hyperproperty Violations
Norine Coenen, Raimund Dachselt, Bernd Finkbeiner +5
Hyperproperties relate multiple computation traces to each other. Model checkers for hyperproperties thus return, in case a system model violates the specification, a set of traces…
Formal Specifications from Natural Language
Christopher Hahn, Frederik Schmitt, Julia J. Tillman +3
We study the generalization abilities of language models when translating natural language into formal specifications with complex semantics. In particular, we fine-tune language m…
Attention Flows for General Transformers
Niklas Metzger, Christopher Hahn, Julian Siber +2
In this paper, we study the computation of how much an input token in a Transformer model influences its prediction. We formalize a method to construct a flow network out of the at…
Causality-Based Game Solving
Christel Baier, Norine Coenen, Bernd Finkbeiner +3
We present a causality-based algorithm for solving two-player reachability games represented by logical constraints. These games are a useful formalism to model a wide array of pro…