Verification of Probabilistic Programs

DOI10.1137/0213021zbMath0533.68012OpenAlexW2001097638MaRDI QIDQ3316558

Amir Pnueli, Sergiu Hart, Micha Sharir

Publication date: 1984

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0213021

zbMATH Keywords

Markov chainsprogram verificationprobabilistic programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Understanding Probabilistic Programs ⋮ On the complexity of deciding fair termination of probabilistic concurrent finite-state programs ⋮ Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ On the hardness of analyzing probabilistic programs ⋮ A Generalisation of Stationary Distributions, and Probabilistic Program Algebra ⋮ Probabilization of logics: completeness and decidability ⋮ Quantitative program logic and expected time bounds in probabilistic distributed algorithms. ⋮ Decidability of finite probabilistic propositional dynamic logics

This page was built for publication: Verification of Probabilistic Programs