Inductive Synthesis for Probabilistic Programs Reaches New Horizons

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU140792" target="_blank" >RIV/00216305:26230/21:PU140792 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-030-72016-2_11" target="_blank" >http://dx.doi.org/10.1007/978-3-030-72016-2_11</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-72016-2_11" target="_blank" >10.1007/978-3-030-72016-2_11</a>

Result language

angličtina

Original language name

Inductive Synthesis for Probabilistic Programs Reaches New Horizons

Original language description

This paper presents a novel method for the automated synthesis of probabilistic programs. The starting point is a program sketch representing a finite family of finite-state Markov chains with related but distinct topologies, and a reachability specification. The method builds on a novel inductive oracle that greedily generates counter-examples (CEs) for violating programs and uses them to prune the family. These CEs leverage the semantics of the family in the form of bounds on its best- and worst-case behaviour provided by a deductive oracle using an MDP abstraction. The method further monitors the performance of the synthesis and adaptively switches between inductive and deductive reasoning. Our experiments demonstrate that the novel CE construction provides a significantly faster and more effective pruning strategy leading to an accelerated synthesis process on a wide range of benchmarks. For challenging problems, such as the synthesis of decentralized partially-observable controllers, we reduce the run-time from a day to minutes.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GJ20-02328Y" target="_blank" >GJ20-02328Y: CAQtuS: Computer-Aided Quantitative Synthesis</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)

ISBN

978-3-030-72015-5

ISSN

—

e-ISSN

—

Number of pages

19

Pages from-to

191-209

Publisher name

Springer International Publishing

Place of publication

Cham

Event location

Lucemburk

Event date

Mar 27, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—