An Exercise in Verifying Sequential Programs with VerCors

Sebastiaan Jozef Christiaan Joosten, Wytse Oortwijn, Mohsen Safari, Marieke Huisman

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)
    128 Downloads (Pure)


    Society nowadays relies heavily on software, which makes verifying the correctness of software crucially important. Various verification tools have been proposed for this purpose, each focusing on a limited set of tasks, as there are many different ways to build and reason about software. This paper discusses two case studies from the VerifyThis2018 verification competition, worked out using the VerCors verification toolset. Interestingly, these case studies are sequential, while VerCors specialises in reasoning about parallel and concurrent software. This paper elaborates on our experiences of using VerCors to verify sequential programs. The first case study involves specifying and verifying the behaviour of a gap buffer; a data-structure commonly used in text editors. The second case study involves verifying a combinatorial problem based on Project Euler problem #114. We find that VerCors is well capable of reasoning about sequential software, and that certain techniques to reason about concurrency can help to reason about sequential programs. However, the extra annotations required to reason about concurrency bring some specificational overhead.
    Original languageEnglish
    Title of host publicationISSTA '18: Companion Proceedings for the ISSTA/ECOOP 2018 Workshops
    Number of pages6
    Publication statusPublished - 16 Jul 2018
    Event20th Workshop on Formal Techniques for Java-like Programs Formal techniques: FTfJP 2018 with ECOOP and ISSTA - Amsterdam, Netherlands
    Duration: 16 Jul 201821 Jul 2018
    Conference number: 20


    Conference20th Workshop on Formal Techniques for Java-like Programs Formal techniques
    Abbreviated titleFTfJP 2018
    Internet address

    Cite this