Pages that link to "Item:Q3021957"
From MaRDI portal
The following pages link to VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (Q3021957):
Displaying 15 items.
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- Toward automatic verification of quantum programs (Q667515) (← links)
- A temporal logic for proving properties of topologically general executions (Q1917070) (← links)
- A semantics and a logic for \textit{Fuzzy Arden Syntax} (Q2099984) (← links)
- Generating functions for probabilistic programs (Q2119118) (← links)
- Formal semantics of a classical-quantum language (Q2123052) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- On Probabilistic Techniques for Data Flow Analysis (Q2870284) (← links)
- Exogenous Probabilistic Computation Tree Logic (Q2870286) (← links)
- A Systematic Approach to Probabilistic Pointer Analysis (Q3498445) (← links)
- Hoare Semigroups (Q4640310) (← links)
- VPHL: a verified partial-correctness logic for probabilistic programs (Q5971408) (← links)
- Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs (Q6152664) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)
