Search Results for author: Bernd Finkbeiner

Found 17 papers, 6 papers with code

Hyper Strategy Logic

no code implementations20 Mar 2024 Raven Beutner, Bernd Finkbeiner

In this paper, we present Hyper Strategy Logic (HyperSL), a strategy logic where the outcome of multiple strategy profiles can be compared w. r. t.

On Alternating-Time Temporal Logic, Hyperproperties, and Strategy Sharing

no code implementations19 Dec 2023 Raven Beutner, Bernd Finkbeiner

However, while ATL$^*$ can reason about the strategic ability of agents (e. g., some coalition $A$ can ensure that a goal is reached eventually), we cannot compare multiple strategic interactions, nor can we require multiple agents to follow the same strategy.

Counterfactuals Modulo Temporal Logics

no code implementations15 Jun 2023 Bernd Finkbeiner, Julian Siber

Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality.

counterfactual Counterfactual Reasoning

Iterative Circuit Repair Against Formal Specifications

1 code implementation2 Mar 2023 Matthias Cosler, Frederik Schmitt, Christopher Hahn, Bernd Finkbeiner

We propose a separated hierarchical Transformer for multimodal representation learning of the formal specification and the circuit.

Representation Learning

Formal Specifications from Natural Language

no code implementations4 Jun 2022 Christopher Hahn, Frederik Schmitt, Julia J. Tillman, Niklas Metzger, Julian Siber, Bernd Finkbeiner

We study the generalization abilities of language models when translating natural language into formal specifications with complex semantics.

Automated Theorem Proving

Attention Flows for General Transformers

1 code implementation30 May 2022 Niklas Metzger, Christopher Hahn, Julian Siber, Frederik Schmitt, Bernd Finkbeiner

In this paper, we study the computation of how much an input token in a Transformer model influences its prediction.

Neural Circuit Synthesis from Specification Patterns

1 code implementation NeurIPS 2021 Frederik Schmitt, Christopher Hahn, Markus N. Rabe, Bernd Finkbeiner

We train hierarchical Transformers on the task of synthesizing hardware circuits directly out of high-level logical specifications in linear-time temporal logic (LTL).

Realizing Omega-regular Hyperproperties

no code implementations18 Jan 2021 Bernd Finkbeiner, Christopher Hahn, Jana Hofmann, Leander Tentrup

We furthermore studied the realizability problem of HyperQPTL.

Logic in Computer Science

Syntroids: Synthesizing a Game for FPGAs using Temporal Logic Specifications

no code implementations18 Jan 2021 Gideon Geier, Philippe Heim, Felix Klein, Bernd Finkbeiner

Syntroids is a space shooter arcade game realized on an FPGA, where the control flow architecture has been completely specified in Temporal Stream Logic (TSL) and implemented using reactive synthesis.

Hardware Architecture

Efficient Monitoring of Hyperproperties using Prefix Trees

no code implementations18 Jan 2021 Bernd Finkbeiner, Christopher Hahn, Marvin Stenger, Leander Tentrup

Hyperproperties, such as non-interference and observational determinism, relate multiple computation traces with each other and are thus not monitorable by tools that consider computations in isolation.

Logic in Computer Science

Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

no code implementations7 Oct 2020 Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang

We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL).

Logic in Computer Science Computational Complexity F.4.1; D.2.4

Teaching Temporal Logics to Neural Networks

2 code implementations ICLR 2021 Christopher Hahn, Frederik Schmitt, Jens U. Kreber, Markus N. Rabe, Bernd Finkbeiner

We study two fundamental questions in neuro-symbolic computing: can deep learning tackle challenging problems in logics end-to-end, and can neural networks learn the semantics of logics.

Proceedings 3rd Workshop on formal reasoning about Causation, Responsibility, and Explanations in Science and Technology

no code implementations1 Jan 2019 Bernd Finkbeiner, Samantha Kleinberg

A further objective is to link to the foundations of causal reasoning in the philosophy of sciences and to causal reasoning performed in other areas of computer science, engineering, and beyond.

Philosophy

Synthesizing Skeletons for Reactive Systems

no code implementations25 Mar 2018 Bernd Finkbeiner, Hazem Torfah

This information is represented in the form of a labeled transition system, which we call skeleton.

Temporal Stream Logic: Synthesis beyond the Bools

2 code implementations1 Dec 2017 Bernd Finkbeiner, Felix Klein, Ruzica Piskac, Mark Santolucito

On the other hand, however, synthesis from TSL is scalable, because it is independent of the complexity of the handled data.

Logic in Computer Science

Temporal Logics for Hyperproperties

1 code implementation17 Jan 2014 Michael R. Clarkson, Bernd Finkbeiner, Masoud Koleini, Kristopher K. Micinski, Markus N. Rabe, César Sánchez

Standard temporal logics such as LTL, CTL, and CTL* can refer only to a single path at a time, hence cannot express many hyperproperties of interest.

Logic in Computer Science

Cannot find the paper you are looking for? You can Submit a new open access paper.