Semantics of probabilistic programs

From MaRDI portal

Publication:1159979

Jump to:navigation, search

DOI10.1016/0022-0000(81)90036-2zbMath0476.68019OpenAlexW2024355065MaRDI QIDQ1159979

Dexter Kozen

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90036-2

zbMATH Keywords

ordered domains action on fixed inputs programs as continuous linear operators on a Banach space of measures programs as partial measurable functions on a measurable space semantics for a high level probabilistic programming language

Mathematics Subject Classification ID

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

Related Items

Formal semantics of a classical-quantum language, Continualization of Probabilistic Programs With Correction, Learning probabilistic termination proofs, Model checking finite-horizon Markov chains with probabilistic inference, Rigorous roundoff error analysis of probabilistic floating-point computations, A denotational semantics for low-level probabilistic programs with nondeterminism, Hennessy-Milner results for probabilistic PDL, Borel kernels and their approximation, categorically, The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator, Understanding Probabilistic Programs, Reasoning about probabilistic sequential programs, Unifying Theories of Programming with Monads, Commutativity of quantum weakest preconditions, The expectation monad in quantum foundations, Probabilistic Analysis of Programs: A Weak Limit Approach, Unnamed Item, Dynamic logic with program specifications and its relational proof system, Semantics of Probabilistic Programs: A Weak Limit Approach, On the Hardness of Almost–Sure Termination, From probability monads to commutative effectuses, Approximate counting in SMT and value estimation for probabilistic programs, Continuity spaces: Reconciling domains and metric spaces, Generic weakest precondition semantics from monads enriched with order, Approximating labelled Markov processes, Control-data separation and logical condition propagation for efficient inference on probabilistic programs, Unnamed Item, Unnamed Item, The syntactic side of autonomous categories enriched over generalised metric spaces, Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism, A probability perspective, Conditioning in probabilistic programming, Reversible monadic computing, An effect-theoretic account of Lebesgue integration, Healthiness conditions for predicate transformers, VPHL: a verified partial-correctness logic for probabilistic programs, Proofs of randomized algorithms in Coq, On Higher-Order Probabilistic Subrecursion, Commutative Semantics for Probabilistic Programming, Unnamed Item, On the hardness of analyzing probabilistic programs, Correctness of sequential Monte Carlo inference for probabilistic programming languages, Densities of almost surely terminating probabilistic programs are differentiable almost everywhere, Automated termination analysis of polynomial probabilistic programs, Probabilistic rely-guarantee calculus, A Generalisation of Stationary Distributions, and Probabilistic Program Algebra, Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions, Probabilistic Logic over Paths, Computable Exchangeable Sequences Have Computable de Finetti Measures, Linear Structures for Concurrency in Probabilistic Programming Languages, The converse of a stochastic relation, Quantification of integrity, The probabilistic powerdomain for stably compact spaces, A Type Theory for Probabilistic and Bayesian Reasoning, Unnamed Item, Bisimulation for labelled Markov processes, Partial correctness for probabilistic demonic programs, Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs, Probabilistic NetKAT, An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages, Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs, Measure Transformer Semantics for Bayesian Machine Learning, Categories of Timed Stochastic Relations, Inferring expected runtimes of probabilistic integer programs using expected sizes, A Theory of Slicing for Probabilistic Control Flow Graphs, A computable approach to measure and integration theory, Moment-based analysis of Bayesian network properties, Characterizations of semantic domains for randomized algorithms, \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis, Confluence in probabilistic rewriting, A probabilistic dynamic logic, Measure and probability for concurrency theorists, On finite-state approximants for probabilistic computation tree logic, Labelled Markov Processes as Generalised Stochastic Relations, A probabilistic PDL, On Probabilistic Techniques for Data Flow Analysis, Decidability of finite probabilistic propositional dynamic logics

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1159979&oldid=13218641"