| 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 | 127 | 2016 |
| 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 | 96 | 2011 |
| 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 | 93 | 2013 |
| Symbolic bisimulation in the spi calculus J Borgström, S Briais, U Nestmann International Conference on Concurrency Theory, 161-176, 2004 | 71 | 2004 |
| 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 | 67 | 2014 |
| Broadcast psi-calculi with an application to wireless protocols J Borgström, S Huang, M Johansson, P Raabjerg, B Victor, ... Software & Systems Modeling 14, 201-216, 2015 | 55 | 2015 |
| Measure transformer semantics for Bayesian machine learning J Borgström, AD Gordon, M Greenberg, J Margetson, J Van Gael Logical Methods in Computer Science 9 (3), 2013 | 48 | 2013 |
| Deriving probability density functions from probabilistic functional programs S Bhat, J Borgström, AD Gordon, C Russo Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013 | 47 | 2013 |
| Universal probabilistic programming offers a powerful approach to statistical phylogenetics F Ronquist, J Kudlicka, V Senderov, J Borgström, N Lartillot, D Lundén, ... Communications biology 4 (1), 244, 2021 | 42 | 2021 |
| On bisimulations for the spi calculus J Borgström, U Nestmann International Conference on Algebraic Methodology and Software Technology …, 2002 | 42 | 2002 |
| 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 | 40 | 2013 |
| Modal logics for nominal transition systems J Parrow, J Borgström, LH Eriksson, R Forsberg Gutkovas, T Weber Logical Methods in Computer Science 17, 2021 | 31 | 2021 |
| Roles, stacks, histories: A triple for Hoare J Borgström, AD Gordon, R Pucella Journal of Functional Programming 21 (2), 159-207, 2011 | 30 | 2011 |
| Verifying a structured peer-to-peer overlay network: The static case J Borgström, U Nestmann, L Onana, D Gurov Global Computing: IST/FET International Workshop, GC 2004 Rovereto, Italy …, 2005 | 30 | 2005 |
| On bisimulations for the spi calculus J Borgström, U Nestmann Mathematical Structures in Computer Science 15 (3), 487-552, 2005 | 29 | 2005 |
| Higher-order psi-calculi J Parrow, J Borgström, P Raabjerg, J Åman Pohjola Mathematical Structures in Computer Science 24 (2), 2014 | 24 | 2014 |
| Maintaining database integrity with refinement types IG Baltopoulos, J Borgström, AD Gordon European Conference on Object-Oriented Programming, 484-509, 2011 | 19 | 2011 |
| 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 |
| Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. D Lundén, J Borgström, D Broman ESOP, 404-431, 2021 | 15 | 2021 |
| Bayesian inference for probabilistic programs via symbolic execution G Claret, SK Rajamani, AV Nori, AD Gordon, J Borgström Microsoft Research, Tech. Rep. MSR-TR-2012-86, 2012 | 14 | 2012 |
Andrew D GordonMicrosoft Research and University of Edinburgh在 microsoft.com 的电子邮件经过验证
