1 citations · 2 across the 3 of their papers we have counts for
4 papers
CounterExample Guided Neural Synthesis
Elizabeth Polgreen, Ralph Abboud, Daniel Kroening
Program synthesis is the generation of a program from a specification. Correct synthesis is difficult, and methods that provide formal guarantees suffer from scalability issues. On…
Verifying Reachability Properties in Markov Chains via Incremental Induction
Elizabeth Polgreen, Martin Brain, Martin Fraenzle +1
There is a scalability gap between probabilistic and non-probabilistic verification. Probabilistic model checking tools are based either on explicit engines or on (Multi-Terminal)…
Automated Experiment Design for Data-Efficient Verification of Parametric Markov Decision Processes
Elizabeth Polgreen, Viraj Wijesuriya, Sofie Haesaert +1
We present a new method for statistical verification of quantitative properties over a partially unknown system with actions, utilising a parameterised model (in this work, a param…
Automated Formal Synthesis of Digital Controllers for State-Space Physical Plants
Alessandro Abate, Iury Bessa, Dario Cattaruzza +5
We present a sound and automated approach to synthesize safe digital feedback controllers for physical plants represented as linear, time invariant models. Models are given as dyna…