Scholar
Johannes Borgström
Google Scholar ID: xXcsqJ4AAAAJ
Associate professor in computing science, Uppsala University
Citations & Impact
Citations
387
H-index
9
i10-index
9
Publications
20
Co-authors
26
list available
Contact
Publications
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
- He has published several papers, including 'Modal Logics for Nominal Transition Systems' (published in Logical Methods in Computer Science, 2021). He defined new program equivalences (context-sensitive bisimulations) and proved their correspondence and differences with observational process equivalence, solving several open problems.
Research Experience
- He worked as a postdoc at Microsoft Research Cambridge, where he researched modern primitives in programming languages such as probabilistic observations for Bayesian modeling, transactional memory for safe parallel imperative programming, and dependent types for verifying state-dependent programs. He also worked on the Applied Process Calculi project, developing formal modeling languages for various types of parallel, distributed, and communicating systems.
Education
- He obtained his Ph.D. from EPFL under the supervision of Uwe Nestmann. His doctoral research focused on process calculi and cryptographic protocols.
Background
- He is a lecturer in computer science at the Department of Information Technology, and the program director for the Bachelor's program in computer science. His research interests include the semantics of programming languages and process algebras, with a focus on both applications and algebraic properties. He is currently working on probabilistic programming languages for statistical models and Bayesian inference, as well as how e-graphs can be used to improve optimizing compilers.
Miscellany
- His current research focuses on probabilistic programming languages for statistical models and Bayesian inference, as well as how e-graphs can be used to improve optimizing compilers.
