Cargando…
The probabilistic termination tool amber
We describe the Amber tool for proving and refuting the termination of a class of probabilistic while-programs with polynomial arithmetic, in a fully automated manner. Amber combines martingale theory with properties of asymptotic bounding functions and implements relaxed versions of existing probab...
Autores principales: | Moosbrugger, Marcel, Bartocci, Ezio, Katoen, Joost-Pieter, Kovács, Laura |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10689562/ https://www.ncbi.nlm.nih.gov/pubmed/38046129 http://dx.doi.org/10.1007/s10703-023-00424-z |
Ejemplares similares
-
Automated Termination Analysis of Polynomial Probabilistic Programs
por: Moosbrugger, Marcel, et al.
Publicado: (2021) -
Inductive Synthesis for Probabilistic Programs Reaches New Horizons
por: Andriushchenko, Roman, et al.
Publicado: (2021) -
AmberTools
por: Case, David A., et al.
Publicado: (2023) -
AmberMDrun: A Scripting Tool for Running Amber MD in an Easy Way
por: Zhang, Zhi-Wei, et al.
Publicado: (2023) -
Mora - Automatic Generation of Moment-Based Invariants
por: Bartocci, Ezio, et al.
Publicado: (2020)