Backwards Abstract Interpretation of Probabilistic Programs
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Abstraction of Expectation Functions Using Gaussian Distributions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
An Abstract Analysis of the Probabilistic Termination of Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
An Interval-based Abstraction for Quantifying Information Flow
Electronic Notes in Theoretical Computer Science (ENTCS)
A duality theorem for real C* algebras
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
From Bayesian notation to pure racket via discrete measure-theoretic probability in λZFC
IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Two complementary but equivalent semantic interpretations of a high level probabilistic programming language are given. One of these interprets programs as partial measurable functions on a measurable space. The other interprets programs as continuous linear operators on a Banach space of measures. It is shown how the ordered domains of Scott and others are embedded naturally into these spaces. Two general results about probabilistic programs are proved.