default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Åman Pohjola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Palle Raabjerg, Johannes Åman Pohjola, Tjark Weber:
Broadcast Psi-calculi. Arch. Formal Proofs 2024 (2024)- 2023
- [j8]Johannes Åman Pohjola, Magnus O. Myreen, Miki Tanaka:
A Hoare Logic for Diverging Programs. Arch. Formal Proofs 2023 (2023) - [j7]Hrutvik Kanabar
, Samuel Vivien, Oskar Abrahamsson, Magnus O. Myreen, Michael Norrish, Johannes Åman Pohjola, Riccardo Zanetti:
PureCake: A Verified Compiler for a Lazy Functional Language. Proc. ACM Program. Lang. 7(PLDI): 952-976 (2023) - [c15]Johannes Åman Pohjola, Hira Taqdees Syeda, Miki Tanaka, Krishnan Winter, Tsun Wang Sau, Benjamin Nott, Tiana J. Tsang Ung, Craig McLaughlin, Remy Seassau, Magnus O. Myreen, Michael Norrish, Gernot Heiser:
Pancake: Verified Systems Programming Made Sweeter. PLOS@SOSP 2023: 1-9 - 2022
- [c14]Arve Gengelbach, Johannes Åman Pohjola:
A Verified Cyclicity Checker: For Theories with Overloaded Constants. ITP 2022: 15:1-15:18 - [c13]Johannes Åman Pohjola, Alejandro Gómez-Londoño, James Shaker, Michael Norrish:
Kalas: A Verified, End-To-End Compiler for a Choreographic Language. ITP 2022: 27:1-27:18 - 2020
- [j6]Johannes Åman Pohjola:
Psi-Calculi Revisited: Connectivity and Compositionality. Log. Methods Comput. Sci. 16(4) (2020) - [j5]Alejandro Gómez-Londoño, Johannes Åman Pohjola, Hira Taqdees Syeda, Magnus O. Myreen, Yong Kiam Tan:
Do you have space for dessert? a verified space cost semantics for CakeML programs. Proc. ACM Program. Lang. 4(OOPSLA): 204:1-204:29 (2020) - [c12]Johannes Åman Pohjola, Arve Gengelbach:
A Mechanised Semantics for HOL with Ad-hoc Overloading. LPAR 2020: 498-515 - [c11]Arve Gengelbach, Johannes Åman Pohjola, Tjark Weber:
Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading. LFMTP 2020: 1-17 - [i2]Johannes Åman Pohjola, Arve Gengelbach:
A Mechanised Semantics for HOL with Ad-hoc Overloading. CoRR abs/2002.10212 (2020)
2010 – 2019
- 2019
- [j4]Adam Sandberg Ericsson, Magnus O. Myreen, Johannes Åman Pohjola:
A Verified Generational Garbage Collector for CakeML. J. Autom. Reason. 63(2): 463-488 (2019) - [c10]Johannes Åman Pohjola:
Psi-Calculi Revisited: Connectivity and Compositionality. FORTE 2019: 3-20 - [c9]Johannes Åman Pohjola, Henrik Rostedt, Magnus O. Myreen:
Characteristic Formulae for Liveness Properties of Non-Terminating CakeML Programs. ITP 2019: 32:1-32:19 - [i1]Johannes Åman Pohjola:
Psi-Calculi Revisited: Connectivity and Compositionality. CoRR abs/1909.06692 (2019) - 2018
- [c8]Sólrún Halla Einarsdóttir, Moa Johansson, Johannes Åman Pohjola:
Into the Infinite - Theory Exploration for Coinduction. AISC 2018: 70-86 - [c7]Hugo Férée, Johannes Åman Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, Son Ho:
Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications. VSTTE 2018: 88-111 - 2017
- [c6]Adam Sandberg Ericsson, Magnus O. Myreen, Johannes Åman Pohjola:
A Verified Generational Garbage Collector for CakeML. ITP 2017: 444-461 - 2016
- [b1]Johannes Åman Pohjola:
Culling Concurrency Theory : Reusable and trustworthy meta-theory, proof techniques and separation results. Uppsala University, Sweden, 2016 - [j3]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) - [c5]Johannes Åman Pohjola, Joachim Parrow:
Bisimulation up-to techniques for psi-calculi. CPP 2016: 142-153 - [c4]Johannes Åman Pohjola, Joachim Parrow:
The Expressive Power of Monotonic Parallel Composition. ESOP 2016: 780-803 - 2015
- [j2]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. Softw. Syst. Model. 14(1): 201-216 (2015) - 2014
- [j1]Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola:
Higher-order psi-calculi. Math. Struct. Comput. Sci. 24(2) (2014) - [c3]Johannes Åman Pohjola, Joachim Parrow:
Priorities Without Priorities: Representing Preemption in Psi-Calculi. EXPRESS/SOS 2014: 2-15 - 2013
- [c2]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 - 2011
- [c1]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
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:11 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:
