default search action
Johannes Borgström
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j10]Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. Log. Methods Comput. Sci. 17(1) (2021) - [c25]Daniel Lundén
, Johannes Borgström
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. ESOP 2021: 404-431 - 2020
- [i4]Daniel Lundén, Johannes Borgström, David Broman:
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. CoRR abs/2003.05191 (2020)
2010 – 2019
- 2019
- [i3]Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. CoRR abs/1904.02564 (2019) - 2017
- [j9]Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo:
Deriving Probability Density Functions from Probabilistic Functional Programs. Log. Methods Comput. Sci. 13(2) (2017) - [c24]Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson:
Weak Nominal Modal Logic. FORTE 2017: 179-193 - [i2]Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo:
Deriving Probability Density Functions from Probabilistic Functional Programs. CoRR abs/1704.00917 (2017) - 2016
- [j8]Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, Ramunas Gutkovas:
Modal Logics for Nominal Transition Systems. Arch. Formal Proofs 2016 (2016) - [j7]Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
A Sorted Semantic Framework for Applied Process Calculi. Log. Methods Comput. Sci. 12(1) (2016) - [c23]Johannes Borgström, Ugo Dal Lago
A lambda-calculus foundation for universal probabilistic programming. ICFP 2016: 33-46 - [c22]Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio V. Russo, Adam Scibior, Marcin Szymczak:
Fabular: regression formulas as probabilistic programming. POPL 2016: 271-283 - 2015
- [j6]Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola
Broadcast psi-calculi with an application to wireless protocols. Softw. Syst. Model. 14(1): 201-216 (2015) - [j5]Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, Björn Victor:
The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi. ACM Trans. Embed. Comput. Syst. 14(1): 9:1-9:25 (2015) - [c21]Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. CONCUR 2015: 198-211 - [c20]Andrew D. Gordon, Claudio V. Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel, Daniel Tarlow:
Probabilistic Programs as Spreadsheet Queries. ESOP 2015: 1-25 - [i1]Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak:
A Lambda-Calculus Foundation for Universal Probabilistic Programming. CoRR abs/1512.08990 (2015) - 2014
- [j4]Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola
Higher-order psi-calculi. Math. Struct. Comput. Sci. 24(2) (2014) - [c19]Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio V. Russo, Johannes Borgström, John Guiver:
Tabular: a schema-driven probabilistic programming language. POPL 2014: 321-334 - [e2]Johannes Borgström, Silvia Crafa:
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. EPTCS 160, 2014 [contents] - 2013
- [j3]Johannes Borgström, Andrew D. Gordon, Michael Greenberg
Measure Transformer Semantics for Bayesian Machine Learning. Log. Methods Comput. Sci. 9(3) (2013) - [c18]Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, Björn Victor:
A Parametric Tool for Applied Process Calculi. ACSD 2013: 180-185 - [c17]Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgström, Guillaume Claret, Thore Graepel, Aditya V. Nori, Sriram K. Rajamani, Claudio V. Russo:
A model-learner pattern for bayesian reasoning. POPL 2013: 403-416 - [c16]Guillaume Claret, Sriram K. Rajamani, Aditya V. Nori, Andrew D. Gordon, Johannes Borgström:
Bayesian inference using data flow analysis. ESEC/SIGSOFT FSE 2013: 92-102 - [c15]Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo:
Deriving Probability Density Functions from Probabilistic Functional Programs. TACAS 2013: 508-522 - [c14]Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract). TGC 2013: 103-118 - [e1]Johannes Borgström, Bas Luttik:
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. EPTCS 120, 2013 [contents] - 2011
- [j2]Johannes Borgström, Andrew D. Gordon, Riccardo Pucella:
Roles, stacks, histories: A triple for Hoare. J. Funct. Program. 21(2): 159-207 (2011) - [c13]Ioannis G. Baltopoulos, Johannes Borgström, Andrew D. Gordon:
Maintaining Database Integrity with Refinement Types. ECOOP 2011: 484-509 - [c12]Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael:
Measure Transformer Semantics for Bayesian Machine Learning. ESOP 2011: 77-96 - [c11]Johannes Borgström, Juan Chen, Nikhil Swamy:
Verifying stateful programs with substructural state and hoare types. PLPV 2011: 15-26 - [c10]Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola
Broadcast Psi-calculi with an Application to Wireless Protocols. SEFM 2011: 74-89 - 2010
- [p1]Johannes Borgström, Andrew D. Gordon, Riccardo Pucella:
Roles, Stacks, Histories: A Triple for Hoare. Reflections on the Work of C. A. R. Hoare 2010: 71-99
2000 – 2009
- 2009
- [c9]Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon:
A compositional theory for STM Haskell. Haskell 2009: 69-80 - 2008
- [c8]Sven Schneider, Johannes Borgström, Uwe Nestmann:
Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms. SJTU-TUB Joint Workshop 2008: 97-104 - [c7]Johannes Borgström:
A Complete Symbolic Bisimilarity for an Extended Spi Calculus. SecCo@CONCUR 2008: 3-20 - 2007
- [c6]Johannes Borgström, Andrew D. Gordon, Andrew Phillips:
A Chart Semantics for the Pi-Calculus. EXPRESS 2007: 3-29 - 2006
- [c5]Johannes Borgström, Olga Grinchtein, Simon Kramer:
Timed Calculus of Cryptographic Communication. Formal Aspects in Security and Trust 2006: 16-30 - 2005
- [j1]Johannes Borgström, Uwe Nestmann:
On bisimulations for the spi calculus. Math. Struct. Comput. Sci. 15(3): 487-552 (2005) - [c4]Johannes Borgström:
Static Equivalence is Harder than Knowledge. EXPRESS 2005: 45-57 - 2004
- [c3]Johannes Borgström, Sébastien Briais, Uwe Nestmann:
Symbolic Bisimulation in the Spi Calculus. CONCUR 2004: 161-176 - [c2]Johannes Borgström, Uwe Nestmann, Luc Onana Alima, Dilian Gurov
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case. Global Computing 2004: 250-265 - 2002
- [c1]Johannes Borgström, Uwe Nestmann:
On Bisimulations for the Spi Calculus. AMAST 2002: 287-303
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: