activity
20202026
most citedFormal Specifications from Natural Language

13 citations · 22 across the 16 of their papers we have counts for

collaborators

16 papers

cs.LG2026

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…

cs.LO2026

Knowledge Compilation for Quantification in Alternating Automata

S. Akshay, Alfredo Cantarella, Supratik Chakraborty +2

We present a knowledge compilation approach for existential and universal quantification in alternating automata. Knowledge compilation transforms formulas into normal forms with s…

cs.LO2025

Universal Safety Controllers with Learned Prophecies

Bernd Finkbeiner, Niklas Metzger, Satya Prakash Nayak +1

\emph{Universal Safety Controllers (USCs)} are a promising logical control framework that guarantees the satisfaction of a given temporal safety specification when applied to any r…

cs.LO2025

Synthesis of Universal Safety Controllers

Bernd Finkbeiner, Niklas Metzger, Satya Prakash Nayak +1

The goal of logical controller synthesis is to automatically compute a control strategy that regulates the discrete, event-driven behavior of a given plant s.t. a temporal logic sp…

cs.LO2024

Information Flow Guided Synthesis with Unbounded Communication

Bernd Finkbeiner, Niklas Metzger, Yoram Moses

Information flow guided synthesis is a compositional approach to the automated construction of distributed systems where the assumptions between the components are captured as info…

cs.LO2024★ 2 cited

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…

cs.LO2024

Monitoring Second-Order Hyperproperties

Raven Beutner, Bernd Finkbeiner, Hadar Frenkel +1

Hyperproperties express the relationship between multiple executions of a system. This is needed in many AI-related fields, such as knowledge representation and planning, to captur…

cs.LO2023★ 1 cited

Second-Order Hyperproperties

Raven Beutner, Bernd Finkbeiner, Hadar Frenkel +1

We introduce HyperLTL, a temporal logic for the specification of hyperproperties that allows for second-order quantification over sets of traces. Unlike first-order temporal lo…

cs.LO2022★ 1 cited

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…

cs.SE2022★ 13 cited

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…

cs.LG2022

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…

cs.LO2022★ 1 cited

Information Flow Guided Synthesis (Full Version)

Bernd Finkbeiner, Niklas Metzger, Yoram Moses

Compositional synthesis relies on the discovery of assumptions, i.e., restrictions on the behavior of the remainder of the system that allow a component to realize its specificatio…

cs.FL2021

Conservative Hybrid Automata from Development Artifacts

Niklas Metzger, Sanny Schmitt, Maximilian Schwenger

The verification of cyber-physical systems operating in a safety-critical environment requires formal system models. The validity of the verification hinges on the precision of the…

cs.HC2021

Visual Analysis of Hyperproperties for Understanding Model Checking Results

Tom Horak, Norine Coenen, Niklas Metzger +6

Model checkers provide algorithms for proving that a mathematical model of a system satisfies a given specification. In case of a violation, a counterexample that shows the erroneo…

cs.LO2021

Live Synthesis

Bernd Finkbeiner, Felix Klein, Niklas Metzger

Synthesis automatically constructs an implementation that satisfies a given logical specification. In this paper, we study the live synthesis problem, where the synthesized impleme…

cs.LO2020★ 4 cited

Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems

Jesko Hecking-Harbusch, Niklas O. Metzger

The manual implementation of distributed systems is an error-prone task because of the asynchronous interplay of components and the environment. Bounded synthesis automatically gen…