On the hardness of analyzing probabilistic programs (Q1733103): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2803490327 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57800485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic relational reasoning for differential privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Analysis of Probabilistic Programs Through Positivstellensatz’s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247126 / 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: Probabilistic NetKAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of Probabilistic Concurrent Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning in probabilistic programming / 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: Inferring covariances for probabilistic programs / 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: Linear-Invariant Generation for Probabilistic Programs: / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Predicates and Quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability theory. A comprehensive course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic PDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination by Monadic Affine Sized Typing / 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: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5305630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Probabilistic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination of CHRiSM Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic termination versus fair termination / rank
 
Normal rank

Latest revision as of 19:50, 18 July 2024

scientific article
Language Label Description Also known as
English
On the hardness of analyzing probabilistic programs
scientific article

    Statements

    On the hardness of analyzing probabilistic programs (English)
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references