Johannes Borgström

45 papers A* 3A 6B 3C 2Journal 15Unranked 11
YearRankTypeTitle / Venue / Authors
2025 J jnl
CoreDPPL: Towards a Sound Composition of Differentiation, ODE Solving, and Probabilistic Programming.
CoRR
Oscar Eriksson, Anders Ågren Thuné, Johannes Borgström, David Broman
2021 A conf
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages.
ESOP
Daniel Lundén, Johannes Borgström, David Broman
2021 J jnl
Modal Logics for Nominal Transition Systems.
Log. Methods Comput. Sci.
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
2020 J jnl
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages.
CoRR
Daniel Lundén, Johannes Borgström, David Broman
2020 — ch.
Tabular: Probabilistic Inference from the Spreadsheet.
Foundations of Probabilistic Programming
Andrew D. Gordon, Claudio V. Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel, Daniel Tarlow
2019 J jnl
Modal Logics for Nominal Transition Systems.
CoRR
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
2017 J jnl
Deriving Probability Density Functions from Probabilistic Functional Programs.
CoRR
Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo
2017 J jnl
Deriving Probability Density Functions from Probabilistic Functional Programs.
Log. Methods Comput. Sci.
Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo
2017 C conf
Weak Nominal Modal Logic.
FORTE
Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson
2016 J jnl
A Sorted Semantic Framework for Applied Process Calculi.
Log. Methods Comput. Sci.
Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
2016 A conf
A lambda-calculus foundation for universal probabilistic programming.
ICFP
Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak
2016 A* conf
Fabular: regression formulas as probabilistic programming.
POPL
Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio V. Russo, Adam Scibior, Marcin Szymczak
2016 J jnl
Modal Logics for Nominal Transition Systems.
Arch. Formal Proofs
Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, Ramunas Gutkovas
2015 J jnl
A Lambda-Calculus Foundation for Universal Probabilistic Programming.
CoRR
Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak
2015 J jnl
Broadcast psi-calculi with an application to wireless protocols.
Softw. Syst. Model.
Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow
2015 B conf
Modal Logics for Nominal Transition Systems.
CONCUR
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
2015 A conf
Probabilistic Programs as Spreadsheet Queries.
ESOP
Andrew D. Gordon, Claudio V. Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel, Daniel Tarlow
2015 J jnl
The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi.
ACM Trans. Embed. Comput. Syst.
Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, Björn Victor
2014 J jnl
Higher-order psi-calculi.
Math. Struct. Comput. Sci.
Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola
2014 — ed.
Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, EXPRESS 2014, and 11th Workshop on Structural Operational Semantics, SOS 2014, Rome, Italy, 1st September 2014.
EXPRESS/SOS
Johannes Borgström, Silvia Crafa
2014 A* conf
Tabular: a schema-driven probabilistic programming language.
POPL
Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio V. Russo, Johannes Borgström, John Guiver
2013 — conf
A Parametric Tool for Applied Process Calculi.
ACSD
Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, Björn Victor
2013 — conf
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract).
TGC
Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
2013 A* conf
A model-learner pattern for bayesian reasoning.
POPL
Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgström, Guillaume Claret, Thore Graepel, Aditya V. Nori, Sriram K. Rajamani, Claudio V. Russo
2013 — conf
Bayesian inference using data flow analysis.
ESEC/SIGSOFT FSE
Guillaume Claret, Sriram K. Rajamani, Aditya V. Nori, Andrew D. Gordon, Johannes Borgström
2013 A conf
Deriving Probability Density Functions from Probabilistic Functional Programs.
TACAS
Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo
2013 J jnl
Measure Transformer Semantics for Bayesian Machine Learning.
Log. Methods Comput. Sci.
Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael
2013 — ed.
Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, EXPRESS/SOS 2013, Buenos Aires, Argentina, 26th August, 2013.
EXPRESS/SOS
Johannes Borgström, Bas Luttik
2011 B conf
Broadcast Psi-calculi with an Application to Wireless Protocols.
SEFM
Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow
2011 A conf
Maintaining Database Integrity with Refinement Types.
ECOOP
Ioannis G. Baltopoulos, Johannes Borgström, Andrew D. Gordon
2011 A conf
Measure Transformer Semantics for Bayesian Machine Learning.
ESOP
Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael
2011 J jnl
Roles, stacks, histories: A triple for Hoare.
J. Funct. Program.
Johannes Borgström, Andrew D. Gordon, Riccardo Pucella
2011 — conf
Verifying stateful programs with substructural state and hoare types.
PLPV
Johannes Borgström, Juan Chen, Nikhil Swamy
2010 — ch.
Roles, Stacks, Histories: A Triple for Hoare.
Reflections on the Work of C. A. R. Hoare
Johannes Borgström, Andrew D. Gordon, Riccardo Pucella
2009 C conf
A compositional theory for STM Haskell.
Haskell
Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon
2008 — conf
A Complete Symbolic Bisimilarity for an Extended Spi Calculus.
SecCo@CONCUR
Johannes Borgström
2008 — —
Equivalences and calculi for formal verification of cryptographic protocols.
Johannes Borgström
2008 — conf
Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms.
SJTU-TUB Joint Workshop
Sven Schneider, Johannes Borgström, Uwe Nestmann
2007 — conf
A Chart Semantics for the Pi-Calculus.
EXPRESS
Johannes Borgström, Andrew D. Gordon, Andrew Phillips
2006 — conf
Timed Calculus of Cryptographic Communication.
Formal Aspects in Security and Trust
Johannes Borgström, Olga Grinchtein, Simon Kramer
2005 J jnl
On bisimulations for the spi calculus.
Math. Struct. Comput. Sci.
Johannes Borgström, Uwe Nestmann
2005 — conf
Static Equivalence
EXPRESS
Johannes Borgström
2004 B conf
Symbolic Bisimulation in the Spi Calculus.
CONCUR
Johannes Borgström, Sébastien Briais, Uwe Nestmann
2004 — conf
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case.
Global Computing
Johannes Borgström, Uwe Nestmann, Luc Onana Alima, Dilian Gurov
2002 — conf
On Bisimulations for the Spi Calculus.
AMAST
Johannes Borgström, Uwe Nestmann