Maksym Bortin

Orcid: 0000-0003-4749-4987

According to our database1, Maksym Bortin authored at least 11 papers between 2004 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Structured development of implementations for divide-and-conquer specifications.
Sci. Comput. Program., January, 2024

2022
From THE BOOK: Two Squares via Involutions.
Arch. Formal Proofs, 2022

Synthesis of Implementations for Divide-and-Conquer Specifications.
Proceedings of the Formal Methods: Foundations and Applications - 25th Brazilian Symposium, 2022

2020
A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs.
CoRR, 2020

2018
Towards verifying ethereum smart contract bytecode in Isabelle/HOL.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2016
A formalisation of the Cocke-Younger-Kasami algorithm.
Arch. Formal Proofs, 2016

COMPLX: A Verification Framework for Concurrent Imperative Programs.
Arch. Formal Proofs, 2016

2010
An approach to the extension of a theorem prover by advanced structuring mechanisms.
PhD thesis, 2010

Structured Formal Development with Quotient Types in Isabelle/HOL.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2006
Structured Formal Development in Isabelle.
Nord. J. Comput., 2006

2004
A First Step Towards Formal Verification of Security Policy Properties for RBAC.
Proceedings of the 4th International Conference on Quality Software (QSIC 2004), 2004


  Loading...