Permission-based Verification of Red-Black Trees and Their Merging - Code

  • Lukas Armborst (Creator)

Dataset

Description

These files implement a red-black tree and an algorithm to concurrently merge such trees. The code is written in Java, and annotated with JML-style comments that allow the VerCors verifier to prove the correctness of e.g. inserting and deleting nodes in the tree, and of the merging algorithm.
Date made available2021
Publisher4TU.Centre for Research Data

Access Dataset

  • 1 Conference contribution

  • Permission-Based Verification of Red-Black Trees and Their Merging

    Armborst, L. & Huisman, M., 24 Jun 2021, FormaliSE 21: Proceedings of the 9th International Conference on Formal Methods in Software Engineering. IEEE, Vol. 1. p. 111-123 13 p. (IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE); vol. 2021, no. 9).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
    8 Citations (Scopus)
    362 Downloads (Pure)

Cite this