Johannes Borgström

According to our database, Johannes Borgström authored at least 30 papers between 2004 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2021

Modal Logics for Nominal Transition Systems.

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber

Log. Methods Comput. Sci., 2021

Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages.

Daniel Lundén, Johannes Borgström, David Broman

Proceedings of the Programming Languages and Systems, 2021

2017

Deriving Probability Density Functions from Probabilistic Functional Programs.

Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo

Log. Methods Comput. Sci., 2017

Weak Nominal Modal Logic.

Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

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

Fabular: regression formulas as probabilistic programming.

Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio V. Russo, Adam Scibior, Marcin Szymczak

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

A lambda-calculus foundation for universal probabilistic programming.

Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

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

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

Probabilistic Programs as Spreadsheet Queries.

Andrew D. Gordon, Claudio V. Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel, Daniel Tarlow

Proceedings of the Programming Languages and Systems, 2015

2014

Higher-order psi-calculi.

Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola

Math. Struct. Comput. Sci., 2014

Tabular: a schema-driven probabilistic programming language.

Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio V. Russo, Johannes Borgström, John Guiver

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013

Measure Transformer Semantics for Bayesian Machine Learning.

Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael

Log. Methods Comput. Sci., 2013

A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract).

Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola

Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013

Bayesian inference using data flow analysis.

Guillaume Claret, Sriram K. Rajamani, Aditya V. Nori, Andrew D. Gordon, Johannes Borgström

Proceedings of the Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, 2013

A model-learner pattern for bayesian reasoning.

Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgström, Guillaume Claret, Thore Graepel, Aditya V. Nori, Sriram K. Rajamani, Claudio V. Russo

Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

A Parametric Tool for Applied Process Calculi.

Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, Björn Victor

Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2011

Roles, stacks, histories: A triple for Hoare.

Johannes Borgström, Andrew D. Gordon, Riccardo Pucella

J. Funct. Program., 2011

Verifying stateful programs with substructural state and hoare types.

Johannes Borgström, Juan Chen, Nikhil Swamy

Proceedings of the 5th ACM Workshop Programming Languages meets Program Verification, 2011

Maintaining Database Integrity with Refinement Types.

Ioannis G. Baltopoulos, Johannes Borgström, Andrew D. Gordon

Proceedings of the ECOOP 2011 - Object-Oriented Programming, 2011

2010

Roles, Stacks, Histories: A Triple for Hoare.

Johannes Borgström, Andrew D. Gordon, Riccardo Pucella

Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009

A compositional theory for STM Haskell.

Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon

Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell, 2009

2008

A Complete Symbolic Bisimilarity for an Extended Spi Calculus.

Johannes Borgström

Proceedings of the 6th Workshop on Security Issues in Concurrency, 2008

Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms.

Sven Schneider, Johannes Borgström, Uwe Nestmann

Proceedings of the Autonomous Systems, 2008

2007

A Chart Semantics for the Pi-Calculus.

Johannes Borgström, Andrew D. Gordon, Andrew Phillips

Proceedings of the 14th International Workshop on Expressiveness in Concurrency, 2007

2006

Timed Calculus of Cryptographic Communication.

Johannes Borgström, Olga Grinchtein, Simon Kramer

Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

2005

On bisimulations for the spi calculus.

Johannes Borgström, Uwe Nestmann

Math. Struct. Comput. Sci., 2005

Static Equivalence <i>is</i> Harder than Knowledge.

Johannes Borgström

Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

2004

Verifying a Structured Peer-to-Peer Overlay Network: The Static Case.

Johannes Borgström, Uwe Nestmann, Luc Onana Alima, Dilian Gurov

Proceedings of the Global Computing, IST/FET International Workshop, 2004

Symbolic Bisimulation in the Spi Calculus.

Johannes Borgström, Sébastien Briais, Uwe Nestmann

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004