Підписатись
Johannes Borgström
Johannes Borgström
Associate professor in computing science, Uppsala University
Підтверджена електронна адреса в it.uu.se - Домашня сторінка
Назва
Посилання
Посилання
Рік
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
1352016
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
942011
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
922013
Symbolic bisimulation in the spi calculus
J Borgström, S Briais, U Nestmann
International Conference on Concurrency Theory, 161-176, 2004
712004
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
682014
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
562015
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
492013
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
472013
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
462021
On bisimulations for the spi calculus
J Borgström, U Nestmann
International Conference on Algebraic Methodology and Software Technology …, 2002
422002
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
372013
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
322021
Roles, stacks, histories: A triple for Hoare
J Borgström, AD Gordon, R Pucella
Journal of Functional Programming 21 (2), 159-207, 2011
302011
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
302005
On bisimulations for the spi calculus
J Borgström, U Nestmann
Mathematical Structures in Computer Science 15 (3), 487-552, 2005
292005
Higher-order psi-calculi
J Parrow, J Borgström, P Raabjerg, J Åman Pohjola
Mathematical Structures in Computer Science 24 (2), 2014
252014
Maintaining database integrity with refinement types
IG Baltopoulos, J Borgström, AD Gordon
European Conference on Object-Oriented Programming, 484-509, 2011
202011
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages.
D Lundén, J Borgström, D Broman
ESOP, 404-431, 2021
182021
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
182011
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
142012
У даний момент система не може виконати операцію. Спробуйте пізніше.
Статті 1–20