Publication Details

Counterexample-Driven Synthesis for Probabilistic Program Sketches

ČEŠKA, M.; HENSE, C.; JUNGES, S.; KATOEN, J. Counterexample-Driven Synthesis for Probabilistic Program Sketches. In Proceedings of the 23rd International Symposium on Formal Methods. Lecture Notes of Computer Science. Porto: Springer International Publishing, 2019. p. 101-120. ISBN: 978-3-030-30941-1.
Czech title
Syntéza pravděpodobnostních programů
Type
conference paper
Language
English
Authors
Češka Milan, doc. RNDr., Ph.D. (DITS)
HENSE, C.
JUNGES, S.
KATOEN, J.
Keywords

probabilistic programs, synthesis, counter-examples, SMT solving

Abstract

Probabilistic programs are key to deal with uncertainty in, e.g., controller synthesis. They are typically small but intricate. Their development is complex and error prone requiring quantitative reasoning over a myriad of alternative designs. To mitigate this complexity, we adopt counterexample-guided inductive synthesis (CEGIS) to automatically synthesise nite-state probabilistic programs. Our approach leverages efficient model checking, modern SMT solving, and counterexample generation at program level. Experiments on practically relevant case studies show that design spaces with millions of candidate designs can be fully explored using a few thousand verification queries.

Published
2019
Pages
101–120
Proceedings
Proceedings of the 23rd International Symposium on Formal Methods.
Series
Lecture Notes of Computer Science
ISBN
978-3-030-30941-1
Publisher
Springer International Publishing
Place
Porto
DOI
EID Scopus
BibTeX
@inproceedings{BUT161455,
  author="ČEŠKA, M. and HENSE, C. and JUNGES, S. and KATOEN, J.",
  title="Counterexample-Driven Synthesis for Probabilistic Program Sketches",
  booktitle="Proceedings of the 23rd International Symposium on Formal Methods.",
  year="2019",
  series="Lecture Notes of Computer Science",
  pages="101--120",
  publisher="Springer International Publishing",
  address="Porto",
  doi="10.1007/978-3-030-30942-8\{_}8",
  isbn="978-3-030-30941-1"
}
Back to top