Tasks in Modular Proofs of Concurrent Algorithms

@article{Castaeda2019TasksIM,
  title={Tasks in Modular Proofs of Concurrent Algorithms},
  author={Armando Casta{\~n}eda and A. Hurault and P. Qu{\'e}innec and M. Roy},
  journal={ArXiv},
  year={2019},
  volume={abs/1909.05537}
}
  • Armando Castañeda, A. Hurault, +1 author M. Roy
  • Published 2019
  • Computer Science
  • ArXiv
  • Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-checked proof systems. In order to build computer-checked proofs with usual tools, such as Coq or TLA+, having sequential specifications of all base objects that are used as building blocks in a given algorithm is a requisite to provide a modular proof built by composition. Alas, many concurrent objects do not have a… CONTINUE READING

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 37 REFERENCES
    Proving a Non-blocking Algorithm for Process Renaming with TLA ^+ +
    1
    Modular Verification of Concurrency-Aware Linearizability
    18
    Unifying Concurrent Objects and Distributed Tasks
    11
    Revisiting Snapshot Algorithms by Refinement-Based Techniques
    17
    Towards Verification of the Pastry Protocol Using TLA +
    33
    Linearizability: a correctness condition for concurrent objects
    2921
    MCMT: A Model Checker Modulo Theories
    114
    Set-linearizability
    28