AI Chat AI Image Generator AI Video Text to Speech

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs

01/17/2019

∙

by Emanuele D'Osualdo, et al.

∙

∙

We introduce TaDA Live, a separation logic for reasoning compositionally about the termination of fine-grained concurrent programs. We illustrate the subtlety of our reasoning using a spin lock and a CLH lock, and prove soundness.

Emanuele D'Osualdo
5 publications
Azadeh Farzan
7 publications
Philippa Gardner
7 publications
Julian Sutherland
2 publications

research

∙ 07/05/2022

A Concurrent Program Logic with a Future and History

Verifying fine-grained optimistic concurrent programs remains an open pr...

0 Roland Meyer, et al. ∙

research

∙ 10/02/2019

Compositional Non-Interference for Fine-Grained Concurrent Programs

We present SeLoC: a relational separation logic for verifying non-interf...

0 Dan Frumin, et al. ∙

research

∙ 12/28/2022

Modular termination verification with a higher-order concurrent separation logic (Intermediate report)

We report on intermediate results of our research on reasoning about liv...

0 Justus Fasse, et al. ∙

research

∙ 02/26/2022

Preventing Timing Side-Channels via Security-Aware Just-In-Time Compilation

Recent work has shown that Just-In-Time (JIT) compilation can introduce ...

0 Qi Qin, et al. ∙

research

∙ 09/13/2021

Specifying and Testing GPU Workgroup Progress Models

As GPU availability has increased and programming support has matured, a...

0 Tyler Sorensen, et al. ∙

research

∙ 12/01/2020

Combining nondeterminism, probability, and termination: equational and metric reasoning

We study monads resulting from the combination of nondeterministic and p...

0 Matteo Mio, et al. ∙

research

∙ 07/28/2023

Context-Aware Separation Logic

Separation logic is often praised for its ability to closely mimic the l...

0 Roland Meyer, et al. ∙