Cantor meets Scott: semantic foundations for probabilistic networks
From MaRDI portal
Publication:5370889
DOI10.1145/3009837.3009843zbMath1380.68132arXiv1607.05830OpenAlexW2551539219WikidataQ60507067 ScholiaQ60507067MaRDI QIDQ5370889
Dexter Kozen, Steffen Juilf Smolka, Nate Foster, Alexandra Silva, Praveen Kumar
Publication date: 20 October 2017
Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.05830
Network design and communication in computer systems (68M10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ A specification logic for programs in the probabilistic guarded command language ⋮ Local completeness logic on Kleene algebra with tests ⋮ Netter: probabilistic, stateful network models ⋮ ProbNetKAT ⋮ Undecidable Problems for Probabilistic Network Programming
This page was built for publication: Cantor meets Scott: semantic foundations for probabilistic networks
