A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit

TL;DR

This paper introduces a separation logic framework to verify the termination of busy-waiting programs on multiprocessor systems, focusing on scenarios where threads may abruptly terminate the program.

Contribution

It presents a novel separation logic that enables modular verification of termination in programs with busy-waiting and abrupt thread termination.

Findings

First formal verification method for busy-waiting termination

Handles arbitrary waitable events via abrupt termination approximation

Supports modular reasoning about concurrent termination

Abstract

Programs for multiprocessor machines commonly perform busy-waiting for synchronisation. In this paper, we make a first step towards proving termination of such programs. We approximate (i) arbitrary waitable events by abrupt program termination and (ii) busy-waiting for events by busy-waiting to be abruptly terminated. We propose a separation logic for modularly verifying termination (under fair scheduling) of programs where some threads eventually abruptly terminate the program, and other threads busy-wait for this to happen.