Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterising FS domains by means of power domains
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
ACM Transactions on Computational Logic (TOCL)
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
A Per Model of Secure Information Flow in Sequential Programs
Higher-Order and Symbolic Computation
A Per Model of Secure Information Flow in Sequential Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Models Supporting Nondeterminism and Probabilistic Choice
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Nondeterminism and Probabilistic Choice: Obeying the Laws
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
CONCUR '01 Proceedings of the 12th 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
The Scott Topology Induces the Weak Topology
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th 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
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
The correspondence between partial metrics and semivaluations
Theoretical Computer Science - Mathematical foundations of programming semantics
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Domains, integration and ‘positive analysis’
Mathematical Structures in Computer Science
Comparative branching-time semantics for Markov chains
Information and Computation
FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
Journal of Functional Programming
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Information and Computation
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Eilenberg--Moore algebras for stochastic relations
Information and Computation
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)
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about probabilistic sequential programs
Theoretical Computer Science
Proof rules for the correctness of quantum programs
Theoretical Computer Science
A projective formalism applied to topological and probabilistic event structures
Mathematical Structures in Computer Science
Domain semantics of possibility computations
Information Sciences: an International Journal
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of Quantum Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Proofs of randomized algorithms in Coq
Science of Computer Programming
Predicate transformers for extended probability and non-determinism
Mathematical Structures in Computer Science
Categories of Timed Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Computable Exchangeable Sequences Have Computable de Finetti Measures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
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)
Electronic Notes in Theoretical Computer Science (ENTCS)
Stably Compact Spaces and the Probabilistic Powerspace construction
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes: Stronger and Faster Approximations
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Observations and Valuations
Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation
Information and Computation
Comparative branching-time semantics for Markov chains
Information and Computation
True-concurrency probabilistic models
Information and Computation
Automating refinement checking in probabilistic system design
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Measure transformer semantics for Bayesian machine learning
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Just do it: simple monadic equational reasoning
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Modeling genome evolution with a DSEL for probabilistic programming
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Towards automated proof support for probabilistic distributed systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about states of probabilistic sequential programs
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
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
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
Weighted probabilistic equivalence preserves ω-regular properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Elementary probability theory in the eindhoven style
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Fundamenta Informaticae
The principles and practice of probabilistic programming
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A model-learner pattern for bayesian reasoning
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Distributed Probabilistic and Quantum Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Measurable Spaces and Their Effect Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |