| Measure transformer semantics for Bayesian machine learning J Borgström, AD Gordon, M Greenberg, J Margetson, J Van Gael European Symposium on Programming, 77-96, 2011 | 75 | 2011 |
| A lambda-calculus foundation for universal probabilistic programming J Borgström, U Dal Lago, AD Gordon, M Szymczak ACM SIGPLAN Notices 51 (9), 33-46, 2016 | 73 | 2016 |
| A Lambda-Calculus Foundation for Universal Probabilistic Programming J Borgström, UD Lago, AD Gordon, M Szymczak arXiv preprint arXiv:1512.08990, 2015 | 73 | 2015 |
| Symbolic bisimulation in the spi calculus J Borgström, S Briais, U Nestmann International Conference on Concurrency Theory, 161-176, 2004 | 69 | 2004 |
| Bayesian inference using data flow analysis G Claret, SK Rajamani, AV Nori, AD Gordon, J Borgström Proceedings of the 2013 9th Joint Meeting on Foundations of Software …, 2013 | 57 | 2013 |
| Tabular: a schema-driven probabilistic programming language AD Gordon, T Graepel, N Rolland, C Russo, J Borgstrom, J Guiver Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014 | 54 | 2014 |
| Broadcast psi-calculi with an application to wireless protocols J Borgström, S Huang, M Johansson, P Raabjerg, B Victor, JÅ Pohjola, ... Software & Systems Modeling 14 (1), 201-216, 2015 | 50 | 2015 |
| Broadcast psi-calculi with an application to wireless protocols J Borgström, S Huang, M Johansson, P Raabjerg, B Victor, JÅ Pohjola, ... International Conference on Software Engineering and Formal Methods, 74-89, 2011 | 50* | 2011 |
| Deriving Probability Density Functions from Probabilistic Functional Programs C Russo, AD Gordon, J Borgström, S Bhat Logical Methods in Computer Science 13, 2017 | 42* | 2017 |
| On bisimulations for the spi calculus J Borgström, U Nestmann International Conference on Algebraic Methodology and Software Technology …, 2002 | 42 | 2002 |
| Deriving probability density functions from probabilistic functional programs S Bhat, J Borgström, AD Gordon, C Russo International Conference on Tools and Algorithms for the Construction and …, 2013 | 39 | 2013 |
| Measure Transformer Semantics for Bayesian Machine Learning J Van Gael, J Margetson, M Greenberg, AD Gordon, J Borgström Logical Methods in Computer Science 9, 2013 | 35* | 2013 |
| A model-learner pattern for Bayesian reasoning AD Gordon, M Aizatulin, J Borgstrom, G Claret, T Graepel, AV Nori, ... ACM SIGPLAN Notices 48 (1), 403-416, 2013 | 34 | 2013 |
| Verifying a structured peer-to-peer overlay network: The static case J Borgström, U Nestmann, L Onana, D Gurov International Workshop on Global Computing, 250-265, 2004 | 30 | 2004 |
| Roles, stacks, histories: A triple for Hoare J Borgström, AD Gordon, R Pucella Journal of Functional Programming 21 (2), 159-207, 2011 | 28 | 2011 |
| Roles, stacks, histories: A triple for Hoare J Borgström, AD Gordon, R Pucella Reflections on the Work of CAR Hoare, 71-99, 2010 | 28 | 2010 |
| On bisimulations for the spi calculus J Borgström, U Nestmann Mathematical Structures in Computer Science 15 (3), 487-552, 2005 | 25 | 2005 |
| Modal logics for nominal transition systems J Parrow, J Borgström, LH Eriksson, R Gutkovas, T Weber 26th International Conference on Concurrency Theory (CONCUR 2015), 2015 | 23* | 2015 |
| Higher-order psi-calculi J Parrow, J Borgström, P Raabjerg, J Åman Pohjola Mathematical Structures in Computer Science 24 (2), 2014 | 20 | 2014 |
| Verifying stateful programs with substructural state and hoare types J Borgstrom, J Chen, N Swamy Proceedings of the 5th ACM workshop on Programming languages meets program …, 2011 | 18 | 2011 |
Andrew D GordonMicrosoft Research and University of EdinburghVerified email at microsoft.com
