- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c11 |      | 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 |
| c10 | | Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, Claudio V. Russo: Deriving Probability Density Functions from Probabilistic Functional Programs. TACAS 2013: 508-522 |
| 2011 | ||
| j5 | | Johannes Borgström, Andrew D. Gordon, Riccardo Pucella: Roles, stacks, histories: A triple for Hoare. J. Funct. Program. 21(2): 159-207 (2011) |
| c9 | | Ioannis G. Baltopoulos, Johannes Borgström, Andrew D. Gordon: Maintaining Database Integrity with Refinement Types. ECOOP 2011: 484-509 |
| c8 | | Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, Jurgen Van Gael: Measure Transformer Semantics for Bayesian Machine Learning. ESOP 2011: 77-96 |
| c7 | | Johannes Borgström, Juan Chen, Nikhil Swamy: Verifying stateful programs with substructural state and hoare types. PLPV 2011: 15-26 |
| c6 | | Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow: Broadcast Psi-calculi with an Application to Wireless Protocols. SEFM 2011: 74-89 |
| 2009 | ||
| j4 | | Johannes Borgström: A Complete Symbolic Bisimilarity for an Extended Spi Calculus. Electr. Notes Theor. Comput. Sci. 242(3): 3-20 (2009) |
| c5 | | Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon: A compositional theory for STM Haskell. Haskell 2009: 69-80 |
| 2008 | ||
| j3 | | Johannes Borgström, Andrew D. Gordon, Andrew Phillips: A Chart Semantics for the Pi-Calculus. Electr. Notes Theor. Comput. Sci. 194(2): 3-29 (2008) |
| 2006 | ||
| j2 | | Johannes Borgström: Static Equivalence is Harder than Knowledge. Electr. Notes Theor. Comput. Sci. 154(3): 45-57 (2006) |
| c4 | | 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. Mathematical Structures in Computer Science 15(3): 487-552 (2005) |
| 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 | | |
Colors in the list of coauthors
Last update Thu May 23 08:13:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page