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

DOI10.1016/J.ENTCS.2009.07.092MaRDI QIDQ2805159zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(5)

• scientific article; zbMATH DE number 7453165 (Why is no real title available?)
• Computable de Finetti measures
• QPCF: higher-order languages and quantum circuits
• scientific article; zbMATH DE number 1324657 (Why is no real title available?)
• Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases

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)