scientific article; zbMATH DE number 3615887
From MaRDI portal
Publication:4179849
zbMath0396.68037MaRDI QIDQ4179849
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items
Least upper bounds for probability measures and their applications to abstractions, Program equivalence in a typed probabilistic call-by-need functional language, CPO's of measures for nondeterminism, Approximating labelled Markov processes, The probabilistic termination tool amber, Foundations for entailment checking in quantitative separation logic, Decomposing probabilistic lambda calculi, Metric Reasoning About $$\lambda $$-Terms: The General Case, Unnamed Item, Densities of almost surely terminating probabilistic programs are differentiable almost everywhere, Unnamed Item, Unnamed Item, Bisimulation for labelled Markov processes, Unnamed Item, Computable de Finetti measures, Using information systems to solve recursive domain equations
