Johannes Åman Pohjola

According to our database1, Johannes Åman Pohjola authored at least 16 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Do you have space for dessert? a verified space cost semantics for CakeML programs.
Proc. ACM Program. Lang., 2020

Psi-Calculi Revisited: Connectivity and Compositionality.
Log. Methods Comput. Sci., 2020

Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading.
Proceedings of the Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2020

A Mechanised Semantics for HOL with Ad-hoc Overloading.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019
A Verified Generational Garbage Collector for CakeML.
J. Autom. Reason., 2019

Characteristic Formulae for Liveness Properties of Non-Terminating CakeML Programs.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Into the Infinite - Theory Exploration for Coinduction.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2018

2016
Culling Concurrency Theory : Reusable and trustworthy meta-theory, proof techniques and separation results.
PhD thesis, 2016

A Sorted Semantic Framework for Applied Process Calculi.
Log. Methods Comput. Sci., 2016

The Expressive Power of Monotonic Parallel Composition.
Proceedings of the Programming Languages and Systems, 2016

Bisimulation up-to techniques for psi-calculi.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015
Broadcast psi-calculi with an application to wireless protocols.
Softw. Syst. Model., 2015

2014
Higher-order psi-calculi.
Math. Struct. Comput. Sci., 2014

Priorities Without Priorities: Representing Preemption in Psi-Calculi.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, 2014

2013
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract).
Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013


  Loading...