Arvid Jakobsson

Orcid: 0000-0001-6028-8972

According to our database1, Arvid Jakobsson authored at least 10 papers between 2015 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Money Grows on (Proof-)Trees: The Formal FA1.2 Ledger Standard.
Proceedings of the 3rd International Workshop on Formal Methods for Blockchains, 2021

2020
Making Tezos Smart Contracts More Reliable with Coq.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Applications, 2020

2019
Automatic Cost Analysis for Imperative BSP Programs.
Int. J. Parallel Program., 2019

Formal methods and software engineering for DL. Security, safety and productivity for DL systems development.
CoRR, 2019

Safe usage of registers in BSPlib.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

2018
Towards formal methods and software engineering for deep learning: Security, safety and productivity for dl systems development.
Proceedings of the 2018 Annual IEEE International Systems Conference, 2018

2017
Runtime Detection of Temporal Memory Errors.
Proceedings of the Runtime Verification - 17th International Conference, 2017

Replicated Synchronization for Imperative BSP Programs.
Proceedings of the International Conference on Computational Science, 2017

2016
Fast as a shadow, expressive as a tree: Optimized memory monitoring for C.
Sci. Comput. Program., 2016

2015
Fast as a shadow, expressive as a tree: hybrid memory monitoring for C.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015


  Loading...