Caricamento...
Automated Termination Analysis of Polynomial Probabilistic Programs
The termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs. Positive almost sure termination (PAST) focuses on termination in a...
Salvato in:
| Pubblicato in: | Programming Languages and Systems |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7984538/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-72019-3_18 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|