Probabilistic semantics of terminating programs

DOI10.1016/0041-5553(88)90146-2zbMATH Open0674.68010OpenAlexW1997743912MaRDI QIDQ3829054

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

semanticsterminationlanguage modelmeasures on set of memory states

Mathematics Subject Classification ID

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

Related Items (9)

A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ The probabilistic termination tool amber ⋮ New approaches for almost-sure termination of probabilistic programs ⋮ Stochastic invariants for probabilistic termination ⋮ Title not available (Why is that?) ⋮ Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs ⋮ Probabilistic termination: soundness, completeness, and compositionality ⋮ Formalising Semantics for Expected Running Time of Probabilistic Programs ⋮ Title not available (Why is that?)

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)