Verification of Probabilistic Programs
From MaRDI portal
Publication:3316558
DOI10.1137/0213021zbMATH Open0533.68012OpenAlexW2001097638MaRDI QIDQ3316558FDOQ3316558
Authors: 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
Recommendations
Cited In (37)
- Probabilistic verification of Boolean functions
- Title not available (Why is that?)
- Time-bounded termination analysis for probabilistic programs with delays
- Latticed \(k\)-induction with an application to probabilistic programs
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
- A debugger for probabilistic programs
- Linear-invariant generation for probabilistic programs: automated support for proof-based methods
- Probabilization of logics: completeness and decidability
- On the hardness of analyzing probabilistic programs
- Inter-program Properties
- Understanding probabilistic programs
- Bounded model checking for probabilistic programs
- Decidability of finite probabilistic propositional dynamic logics
- An assertion-based program logic for probabilistic programs
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
- A generalisation of stationary distributions, and probabilistic program algebra
- Title not available (Why is that?)
- Probabilistic verification and approximation
- Program verification as probabilistic inference
- Validation of Stochastic Systems
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
- CONCUR 2005 – Concurrency Theory
- Does a Program Yield the Right Distribution?
- VPHL: a verified partial-correctness logic for probabilistic programs
- Verification of multiprocess probabilistic protocols
- FM 2005: Formal Methods
- Generating counterexamples for quantitative safety specifications in probabilistic B
- Constructive development of probabilistic programs
- Automatic probabilistic program verification through random variable abstraction
- Towards Automated Proof Support for Probabilistic Distributed Systems
- Data-Driven Invariant Learning for Probabilistic Programs
- Title not available (Why is that?)
- Probabilistic program verification via inductive synthesis of inductive invariants
- Proofs that count
- Title not available (Why is that?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Verification of Probabilistic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316558)
