Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57800587, #quickstatements; #temporary_batch_1706814575051 |
Created claim: DBLP publication ID (P1635): conf/esop/KaminskiKMO16, #quickstatements; #temporary_batch_1731468600454 |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Joost-Pieter Katoen / rank | |||
Property / author | |||
Property / author: Joost-Pieter Katoen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2222812367 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1601.01001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A general framework for sound and complete Floyd-Hoare logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5322945 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic Based Program Synthesis and Transformation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Runtime analysis of probabilistic programs with unbounded recursion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: FM 2005: Formal Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4144755 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic Termination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formalization of time and space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A probability perspective / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automating program analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An axiomatic basis for computer programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484343 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Hardness of Almost–Sure Termination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semantics of probabilistic programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Abstraction, Refinement and Proof for Probabilistic Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability and Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4778698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4856179 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Hoare-like proof system for analysing the computation time of programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semantics with applications: an appetizer. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002149 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3141916 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: conf/esop/KaminskiKMO16 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:05, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs |
scientific article |
Statements
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (English)
0 references
26 April 2016
0 references
probabilistic programs
0 references
expected run-time
0 references
positive almost-sure termination
0 references
weakest precondition
0 references
program verification
0 references