Johannes Borgström

Cited by

	All	Since 2018
Citations	1006	417
h-index	17	10
i10-index	26	10

120

2003200420052006200720082009201020112012201320142015201620172018201920202021202220233 11 14 17 29 19 24 22 41 40 54 59 74 82 85 69 109 47 74 71 46

Public access

View all

4 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Andrew D GordonMicrosoft Research and University of EdinburghVerified email at microsoft.com
Joachim ParrowProfessor in Computing Science, Uppsala UniversityVerified email at it.uu.se
Claudio RussoMicrosoft Research LtdVerified email at microsoft.com
Uwe NestmannProfessor of Computer Science, TU BerlinVerified email at tu-berlin.de
Johannes Åman PohjolaUniversity of New South WalesVerified email at unsw.edu.au
Björn VictorUppsala UniversityVerified email at it.uu.se
Jurgen Van GaelStripeVerified email at stripe.com
Nicolas RollandVerified email at ensae.org
David BromanProfessor, KTH Royal Institute of TechnologyVerified email at kth.se
Daniel LundénPhD student, KTH Royal Institute of TechnologyVerified email at kth.se
Ugo Dal LagoUniversity of Bologna and INRIA Sophia AntipolisVerified email at cs.unibo.it
Lars-Henrik ErikssonUppsala universityVerified email at it.uu.se
Thomas SchönProfessor, Uppsala UniversityVerified email at it.uu.se
Lawrence MurrayUber AIVerified email at uber.com
Jan KudlickaAssociate Professor of Data Science, BI Norwegian Business SchoolVerified email at bi.no
Fredrik RonquistProfessor, Swedish Museum of Natural History, Dept. Bioinformatics and GeneticsVerified email at nrm.se
Viktor SenderovSwedish Museum for Natural HistoryVerified email at nrm.se
nicolas lartillotResearch Director, Université de Lyon 1Verified email at univ-lyon1.fr
Nikhil SwamyMicrosoft ResearchVerified email at microsoft.com
Andrew PhillipsMicrosoft ResearchVerified email at microsoft.com

Johannes Borgström

Associate professor in computing science, Uppsala University

Verified email at it.uu.se - Homepage

Probabilistic programming concurrency type systems


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	112	2016
A Lambda-Calculus Foundation for Universal Probabilistic Programming J Borgström, UD Lago, AD Gordon, M Szymczak arXiv preprint arXiv:1512.08990, 2015	112	2015
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	86	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	77	2013
Symbolic bisimulation in the spi calculus J Borgström, S Briais, U Nestmann International Conference on Concurrency Theory, 161-176, 2004	68	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	63	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	56	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	56*	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	52*	2017
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	45	2013
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	44	2013
On bisimulations for the spi calculus J Borgström, U Nestmann International Conference on Algebraic Methodology and Software Technology …, 2002	41	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	39	2013
On bisimulations for the spi calculus J Borgström, U Nestmann Mathematical Structures in Computer Science 15 (3), 487-552, 2005	31	2005
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	31	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	30*	2015
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
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	24	2021
Higher-order psi-calculi J Parrow, J Borgström, P Raabjerg, J Åman Pohjola Mathematical Structures in Computer Science 24 (2), 2014	22	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

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors