Topology via logic
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Research topics in functional programming
Totally bounded spaces and compact ordered spaces as domains of computation
Topology and category theory in computer science
Probabilistic non-determinism
Handbook of logic in computer science (vol. 1)
Dynamical systems, measures, and fractals via domain theory
Information and Computation
Handbook of logic in computer science (vol. 3)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Multi lingual sequent calculus and coherent spaces
Fundamenta Informaticae
When is a functional program not a functional program?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A Discipline of Programming
The Powerdomain of Indexed Valuations
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Power Domains, Information Systems, and Locales
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Nondeterminism and Probabilistic Choice: Obeying the Laws
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A domain equation for bisimulation
Information and Computation
Entailment systems for stably locally compact locales
Theoretical Computer Science - Logic, semantics and theory of programming
On the computational content of the Lawson topology
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Reasoning about probabilistic sequential programs
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Stably Compact Spaces and the Probabilistic Powerspace construction
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about states of probabilistic sequential programs
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
Probabilistic computation has proven to be a challenging and interesting area of research, both from the theoretical perspective of denotational semantics and the practical perspective of reasoning about probabilistic algorithms. On the theoretical side, the probabilistic powerdomain of Jones and Plotkin represents a significant advance. Further work, especially by Alvarez-Manilla, has greatly improved our understanding of the probabilistic powerdomain, and has helped clarify its relation to classical measure and integration theory. On the practical side, such researchers as Kozen, Segala, Desharnais, and Kwiatkowska, among others, study problems of verification for probabilistic computation by defining various suitable logics for the classes of processes under study. The work reported here begins to bridge the gap between the domain theoretic and verification (model checking) perspectives on probabilistic computation by exhibiting sound and complete logics for probabilistic powerdomains that arise directly from given logics for the underlying domains.