Probabilistic semantics of terminating programs

DOI10.1016/0041-5553(88)90146-2MaRDI QIDQ3829054zbMATH OpenOpenAlexFDO

Authors E. A. Kaz'Mina

Publication date 1988

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(88)90146-2

zbMATH Keywords

language modelmeasures on set of memory statessemanticstermination

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(9)

• A denotational semantics for low-level probabilistic programs with nondeterminism
• Probabilistic termination: soundness, completeness, and compositionality
• Formalising Semantics for Expected Running Time of Probabilistic Programs
• scientific article; zbMATH DE number 4076588 (Why is no real title available?)
• scientific article; zbMATH DE number 1832220 (Why is no real title available?)
• Stochastic invariants for probabilistic termination
• The probabilistic termination tool amber
• New approaches for almost-sure termination of probabilistic programs
• Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs

This page was built for publication: Probabilistic semantics of terminating programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829054)