Probabilistic imperative programming: A rigorous approach (extended abstract)

MaRDI QIDQ4370247zbMATH OpenFDO

Authors Karen Seidel, Carroll Morgan, Annabelle McIver

Publication date 14 January 1998

zbMATH Keywords

imperative programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1759622
• Abstract interpretation of probabilistic semantics
• Probabilistic models for the guarded command language

Cited in

(10)

• PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Linking theories in probabilistic programming
• Fine-grained semantics for probabilistic programs
• scientific article; zbMATH DE number 1692951 (Why is no real title available?)
• A lambda-calculus foundation for universal probabilistic programming
• scientific article; zbMATH DE number 3890702 (Why is no real title available?)
• Probabilistic programming: a true verification challenge
• A type theory for probabilistic and Bayesian reasoning
• On lexicographic proof rules for probabilistic termination

This page was built for publication: Probabilistic imperative programming: A rigorous approach (extended abstract)

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