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...

Full description

Saved in:
Bibliographic Details
Published inFormal methods in system design Vol. 61; no. 1; pp. 90 - 109
Main Authors Moosbrugger, Marcel, Bartocci, Ezio, Katoen, Joost-Pieter, Kovács, Laura
Format Journal Article
LanguageEnglish
Published New York Springer US 01.08.2022
Springer Nature B.V
Subjects
Asymptotic properties
CAE) and Design
Circuits and Systems
Computer-Aided Engineering (CAD
Electrical Engineering
Engineering
Martingales
Mathematical analysis
Original Article
Polynomials
Software Engineering/Programming and Operating Systems
Statistical analysis
Recurrence equations
Probabilistic programs
Asymptotic bounds
Martingales
Almost sure termination
Online AccessGet full text

Cover

More Information
Summary: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 probabilistic termination proof rules to prove/disprove (positive) almost sure termination of probabilistic loops. Amber supports programs parametrized by symbolic constants and drawing from common probability distributions. Our experimental comparisons give practical evidence of Amber outperforming existing state-of-the-art tools.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0925-9856
1572-8102
DOI:10.1007/s10703-023-00424-z