Semi-decidability of may, must and probabilistic testing in a higher-type setting

DOI10.1016/J.ENTCS.2009.07.092zbMATH Open1337.68068OpenAlexW2014952600MaRDI QIDQ2805159FDOQ2805159

Authors: Martín Escardo 

Publication date: 10 May 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.092

Recommendations

• Remarks on testing probabilistic processes
• Publication:4942011
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Testing Finitary Probabilistic Processes
• scientific article; zbMATH DE number 1760049

zbMATH Keywords

denotational semanticspowerdomainsoperational semanticsprobabilistic computationnondeterministic computationexhaustible setshigher-type computability theorymay and must testing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites Work

• PCF extended with real numbers
• Domain theory in logical form
• LCF considered as a programming language
• Title not available (Why is that?)
• Domain-Theoretic Foundations of Functional Programming
• Title not available (Why is that?)
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the non-sequential nature of the interval-domain model of real-number computation
• Continuous Lattices and Domains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monads for which structures are adjoint to units
• Probabilistic observations and valuations (extended abstract)
• Retracted: Semantic domains for combining probability and non-determinism
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributing probability over non-determinism
• A convenient category of domains
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Synthetic topology: of data types and classical spaces
• Exhaustible sets in higher-type computation
• Power domains
• An upper power domain construction in terms of strongly compact sets
• Power domains and second-order predicates
• Title not available (Why is that?)
• Partial correctness for probabilistic demonic programs
• Effectively given domains
• A mathematical semantics for a nondeterministic typed lambda-calculus
• Title not available (Why is that?)
• Representing probability measures using probabilistic processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Operational domain theory and topology of sequential programming languages
• Induction and recursion on the partial real line with applications to Real PCF
• Integration in Real PCF
• Title not available (Why is that?)
• Exact real number computations relative to hereditarily total functionals.
• On the non-sequential nature of domain models of real-number computation
• A functional algorithm for exact real integration with invariant measures

Cited In (5)

• QPCF: higher-order languages and quantum circuits
• Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
• Computable de Finetti measures
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Semi-decidability of may, must and probabilistic testing in a higher-type setting

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