Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Characterising FS domains by means of power domains
Theoretical Computer Science - Domains
Some results on Hahn-Banach-type theorems for continuous D-cones
Theoretical Computer Science - Domains
Stochastic lambda calculus and monads of probability distributions
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
A calculus for probabilistic languages
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Models Supporting Nondeterminism and Probabilistic Choice
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Measuring the Probabilistic Powerdomain
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Nondeterminism and Probabilistic Choice: Obeying the Laws
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Logic for Probabilities in Semantics
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The Scott Topology Induces the Weak Topology
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Riemann and Edalat integration on domains
Theoretical Computer Science - Topology in computer science
A characterization of partial metrizability: domains are quantifiable
Theoretical Computer Science - Topology in computer science
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Measuring the probabilistic powerdomain
Theoretical Computer Science - Special issue on automata, languages and programming
The correspondence between partial metrics and semivaluations
Theoretical Computer Science - Mathematical foundations of programming semantics
Domains, integration and ‘positive analysis’
Mathematical Structures in Computer Science
A probabilistic language based upon sampling functions
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Mathematical Structures in Computer Science
Comparative branching-time semantics for Markov chains
Information and Computation
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Eilenberg--Moore algebras for stochastic relations
Information and Computation
Representing probability measures using probabilistic processes
Journal of Complexity
Admissible Representations of Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Discrete Lawvere theories and computational effects
Theoretical Computer Science - Algebra and coalgebra in computer science
Probabilistic Completion of Nondeterministic Models
Electronic Notes in Theoretical Computer Science (ENTCS)
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about probabilistic sequential programs
Theoretical Computer Science
Discrete random variables over domains
Theoretical Computer Science
Proof rules for the correctness of quantum programs
Theoretical Computer Science
Domain semantics of possibility computations
Information Sciences: an International Journal
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A probabilistic language based on sampling functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic and Concurrent Models for Security
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Temporalization of Probabilistic Propositional Logic
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical relations for monadic types†
Mathematical Structures in Computer Science
Troll, a language for specifying dice-rolls
Proceedings of the 2009 ACM symposium on Applied Computing
Proofs of randomized algorithms in Coq
Science of Computer Programming
Predicate transformers for extended probability and non-determinism
Mathematical Structures in Computer Science
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Stably Compact Spaces and the Probabilistic Powerspace construction
Electronic Notes in Theoretical Computer Science (ENTCS)
The Probabilistic Powerdomain for Stably Compact Spaces via Compact Ordered Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Observations and Valuations
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparative branching-time semantics for Markov chains
Information and Computation
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Comparing free algebras in Topological and Classical Domain Theory
Theoretical Computer Science
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Simulation hemi-metrics between infinite-state stochastic games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
De groot duality and models of choice: Angels, demons and nature†
Mathematical Structures in Computer Science
Reasoning about a distributed probabilistic system
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions
Electronic Notes in Theoretical Computer Science (ENTCS)
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
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Discrete random variables over domains
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reasoning about states of probabilistic sequential programs
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The extended probabilistic powerdomain monad over stably compact spaces
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Proofs of randomized algorithms in CoQ
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Of probabilistic wp and CSP - and compositionality
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Semantics of non-deterministic possibility computation
Fuzzy Sets and Systems
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
Fundamenta Informaticae
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Probabilistic Relational Reasoning for Differential Privacy
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |