scientific article

zbMATH Open0658.68019MaRDI QIDQ3806793

E. A. Kaz'Mina

Publication date: 1988

Title of this publication is not available (Why is that?)

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 (8)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Termination of nondeterministic probabilistic programs 👍 👎
• Fine-grained semantics for probabilistic programs 👍 👎
• Probabilistic termination: soundness, completeness, and compositionality 👍 👎
• Probabilistic Semantics and Program Analysis 👍 👎
• Probabilistic semantics of terminating programs 👍 👎
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s 👍 👎
• New approaches for almost-sure termination of probabilistic programs 👍 👎

This page was built for publication:

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