39 citations · 71 across the 10 of their papers we have counts for
12 papers
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR
Tobias Seufert, Felix Winterer, Christoph Scholl +3
In this paper we revisit the topic of generalizing proof obligations in bit-level Property Directed Reachability (PDR). We provide a comprehensive study which (1) determines the co…
Strengthening Deterministic Policies for POMDPs
Leonore Winterer, Ralf Wimmer, Nils Jansen +1
The synthesis problem for partially observable Markov decision processes (POMDPs) is to compute a policy that satisfies a given specification. Such policies have to take the full e…
Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural Networks
Steven Carr, Nils Jansen, Ralf Wimmer +3
We study strategy synthesis for partially observable Markov decision processes (POMDPs). The particular problem is to determine strategies that provably adhere to (probabilistic) t…
Permissive Finite-State Controllers of POMDPs using Parameter Synthesis
Sebastian Junges, Nils Jansen, Ralf Wimmer +4
We study finite-state controllers (FSCs) for partially observable Markov decision processes (POMDPs) that are provably correct with respect to given specifications. The key insight…
Satisfiability Checking meets Symbolic Computation (Project Paper)
E. Abraham, J. Abbott, B. Becker +12
Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, impleme…
Satisfiability Checking and Symbolic Computation
E. Abraham, J. Abbott, B. Becker +12
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of deci…