Symbolic Bisimulation in the Spi Calculus. - Johannes Borgström; Sébastien Briais; Uwe Nestmann (CONCUR, 2004)

Verifying a Structured Peer-to-Peer Overlay Network: The Static Case. - Johannes Borgström; Uwe Nestmann; Luc Onana Alima; Dilian Gurov (Global Computing, 2004)

Static Equivalence is Harder than Knowledge. - Johannes Borgström (EXPRESS, 2005)

On bisimulations for the spi calculus. - Johannes Borgström; Uwe Nestmann (Math. Struct. Comput. Sci., 2005)

Timed Calculus of Cryptographic Communication. - Johannes Borgström; Olga Grinchtein; Simon Kramer 001 (Formal Aspects in Security and Trust, 2006)

A Chart Semantics for the Pi-Calculus. - Johannes Borgström; Andrew D. Gordon 001; Andrew Phillips (EXPRESS, 2007)

Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms. - Sven Schneider 001; Johannes Borgström; Uwe Nestmann (SJTU-TUB Joint Workshop, 2008)

A Complete Symbolic Bisimilarity for an Extended Spi Calculus. - Johannes Borgström (SecCo@CONCUR, 2008)

A compositional theory for STM Haskell. - Johannes Borgström; Karthikeyan Bhargavan; Andrew D. Gordon 001 (Haskell, 2009)

Roles, Stacks, Histories: A Triple for Hoare. - Johannes Borgström; Andrew D. Gordon 001; Riccardo Pucella (Reflections on the Work of C. A. R. Hoare, 2010)

Maintaining Database Integrity with Refinement Types. - Ioannis G. Baltopoulos; Johannes Borgström; Andrew D. Gordon 001 (ECOOP, 2011)

Verifying stateful programs with substructural state and hoare types. - Johannes Borgström; Juan Chen 002; Nikhil Swamy (PLPV, 2011)

Roles, stacks, histories: A triple for Hoare. - Johannes Borgström; Andrew D. Gordon 001; Riccardo Pucella (J. Funct. Program., 2011)

A Parametric Tool for Applied Process Calculi. - Johannes Borgström; Ramunas Gutkovas; Ioana Rodhe; Björn Victor (ACSD, 2013)

A model-learner pattern for bayesian reasoning. - Andrew D. Gordon 001; Mihhail Aizatulin; Johannes Borgström; Guillaume Claret; Thore Graepel; Aditya V. Nori; Sriram K. Rajamani; Claudio V. Russo (POPL, 2013)

Bayesian inference using data flow analysis. - Guillaume Claret; Sriram K. Rajamani; Aditya V. Nori; Andrew D. Gordon 001; Johannes Borgström (ESEC/SIGSOFT FSE, 2013)

A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract). - Johannes Borgström; Ramunas Gutkovas; Joachim Parrow; Björn Victor; Johannes Åman Pohjola (TGC, 2013)

Measure Transformer Semantics for Bayesian Machine Learning. - Johannes Borgström; Andrew D. Gordon 001; Michael Greenberg 002; James Margetson; Jurgen Van Gael (Log. Methods Comput. Sci., 2013)

Tabular: a schema-driven probabilistic programming language. - Andrew D. Gordon 001; Thore Graepel; Nicolas Rolland; Claudio V. Russo; Johannes Borgström; John Guiver (POPL, 2014)

Higher-order psi-calculi. - Joachim Parrow; Johannes Borgström; Palle Raabjerg; Johannes Åman Pohjola (Math. Struct. Comput. Sci., 2014)

Probabilistic Programs as Spreadsheet Queries. - Andrew D. Gordon 001; Claudio V. Russo; Marcin Szymczak 002; Johannes Borgström; Nicolas Rolland; Thore Graepel; Daniel Tarlow (ESOP, 2015)

Broadcast psi-calculi with an application to wireless protocols. - Johannes Borgström; Shuqin Huang; Magnus Johansson; Palle Raabjerg; Björn Victor; Johannes Åman Pohjola; Joachim Parrow (Softw. Syst. Model., 2015)

The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi. - Johannes Borgström; Ramunas Gutkovas; Ioana Rodhe; Björn Victor (ACM Trans. Embed. Comput. Syst., 2015)

A lambda-calculus foundation for universal probabilistic programming. - Johannes Borgström; Ugo Dal Lago; Andrew D. Gordon 001; Marcin Szymczak 002 (ICFP, 2016)

Fabular: regression formulas as probabilistic programming. - Johannes Borgström; Andrew D. Gordon 001; Long Ouyang; Claudio V. Russo; Adam Scibior; Marcin Szymczak 002 (POPL, 2016)

Modal Logics for Nominal Transition Systems. - Tjark Weber; Lars-Henrik Eriksson; Joachim Parrow; Johannes Borgström; Ramunas Gutkovas (Arch. Formal Proofs, 2016)

A Sorted Semantic Framework for Applied Process Calculi. - Johannes Borgström; Ramunas Gutkovas; Joachim Parrow; Björn Victor; Johannes Åman Pohjola (Log. Methods Comput. Sci., 2016)

Weak Nominal Modal Logic. - Joachim Parrow; Tjark Weber; Johannes Borgström; Lars-Henrik Eriksson (FORTE, 2017)

Deriving Probability Density Functions from Probabilistic Functional Programs. - Sooraj Bhat; Johannes Borgström; Andrew D. Gordon 001; Claudio V. Russo (Log. Methods Comput. Sci., 2017)

Tabular: Probabilistic Inference from the Spreadsheet. - Andrew D. Gordon 001; Claudio V. Russo; Marcin Szymczak 002; Johannes Borgström; Nicolas Rolland; Thore Graepel; Daniel Tarlow (Foundations of Probabilistic Programming, 2020)

Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. - Daniel Lundén; Johannes Borgström; David Broman (ESOP, 2021)

CoreDPPL: Towards a Sound Composition of Differentiation, ODE Solving, and Probabilistic Programming. - Oscar Eriksson; Anders Ågren Thuné; Johannes Borgström; David Broman (CoRR, 2025)