DeepAI
Log In Sign Up

Combining nondeterminism, probability, and termination: equational and metric reasoning

12/01/2020
by   Matteo Mio, et al.
0

We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads, providing equational reasoning tools for establishing equivalences and distances of programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/18/2019

Compositional Analysis for Almost-Sure Termination of Probabilistic Programs

In this work, we consider the almost-sure termination problem for probab...
07/18/2019

Priorities in tock-CSP

The tock-CSP encoding embeds a rich and flexible approach to modelling d...
07/13/2020

Generating Functions for Probabilistic Programs

This paper investigates the usage of generating functions (GFs) encoding...
10/07/2020

Automated Termination Analysis of Polynomial Probabilistic Programs

The termination behavior of probabilistic programs depends on the outcom...
01/17/2019

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs

We introduce TaDA Live, a separation logic for reasoning compositionally...
01/24/2021

Termination Analysis Without the Tears

Determining whether a given program terminates is the quintessential und...
05/12/2019

Simulation Typology and Termination Risks

The goal of the article is to explore what is the most probable type of ...