Cargando…
Inductive Synthesis for Probabilistic Programs Reaches New Horizons
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 o...
Autores principales: | Andriushchenko, Roman, Češka, Milan, Junges, Sebastian, Katoen, Joost-Pieter |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979219/ http://dx.doi.org/10.1007/978-3-030-72016-2_11 |
Ejemplares similares
-
Automated Termination Analysis of Polynomial Probabilistic Programs
por: Moosbrugger, Marcel, et al.
Publicado: (2021) -
Finding Provably Optimal Markov Chains
por: Spel, Jip, et al.
Publicado: (2021) -
The probabilistic termination tool amber
por: Moosbrugger, Marcel, et al.
Publicado: (2023) -
Scenario-Based Verification of Uncertain MDPs
por: Cubuktepe, Murat, et al.
Publicado: (2020) -
PrIC3: Property Directed Reachability for MDPs
por: Batz, Kevin, et al.
Publicado: (2020)