Pages that link to "Item:Q3316558"
From MaRDI portal
The following pages link to Verification of Probabilistic Programs (Q3316558):
Displaying 16 items.
- Probabilistic verification of Boolean functions (Q685120) (← links)
- Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
- Verification of multiprocess probabilistic protocols (Q1079944) (← links)
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs (Q1111384) (← links)
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Probabilization of logics: completeness and decidability (Q2254552) (← links)
- An assertion-based program logic for probabilistic programs (Q2323970) (← links)
- Probabilistic verification and approximation (Q2478551) (← links)
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (Q3021957) (← links)
- Understanding Probabilistic Programs (Q3449623) (← links)
- (Q4501575) (← links)
- (Q4736998) (← links)
- A Generalisation of Stationary Distributions, and Probabilistic Program Algebra (Q4917061) (← links)
