1 citations · 2 across the 6 of their papers we have counts for
8 papers
Synthesizing Dominant Strategies for Liveness (Full Version)
Bernd Finkbeiner, Noemi Passing
Reactive synthesis automatically derives a strategy that satisfies a given specification. However, requiring a strategy to meet the specification in every situation is, in many cas…
Reactive Synthesis of Smart Contract Control Flows
Bernd Finkbeiner, Jana Hofmann, Florian Kohn +1
Smart contracts are small but highly error-prone programs that implement agreements between multiple parties. We present a reactive synthesis approach for the automatic constructio…
Compositional Synthesis of Modular Systems (Full Version)
Bernd Finkbeiner, Noemi Passing
Given the advances in reactive synthesis, it is a natural next step to consider more complex multi-process systems. Distributed synthesis, however, is not yet scalable. Composition…
Temporal Stream Logic modulo Theories (Full Version)
Bernd Finkbeiner, Philippe Heim, Noemi Passing
Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems for which LTL is not expressive…
Specification Decomposition for Reactive Synthesis
Bernd Finkbeiner, Gideon Geier, Noemi Passing
Reactive synthesis is the task of automatically deriving a correct implementation from a specification. It is a promising technique for the development of verified programs and har…
Verified Rust Monitors for Lola Specifications
Bernd Finkbeiner, Stefan Oswald, Noemi Passing +1
The safety of cyber-physical systems rests on the correctness of their monitoring mechanisms. This is problematic if the specification of the monitor is implemented manually or int…
Dependency-based Compositional Synthesis (Full Version)
Bernd Finkbeiner, Noemi Passing
Despite many recent advances, reactive synthesis is still not really a practical technique. The grand challenge is to scale from small transition systems, where synthesis performs…
Representing Pattern Matching Algorithms by Polynomial-Size Automata
Tobias Marschall, Noemi E. Passing
Pattern matching algorithms to find exact occurrences of a pattern in a text have been analyzed extensively with respect to asymptotic best, worst, and average…