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

01/17/2019
by   Emanuele D'Osualdo, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

10/02/2019

Compositional Non-Interference for Fine-Grained Concurrent Programs

We present SeLoC: a relational separation logic for verifying non-interf...
09/13/2021

Specifying and Testing GPU Workgroup Progress Models

As GPU availability has increased and programming support has matured, a...
07/20/2020

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

Programs for multiprocessor machines commonly perform busy-waiting for s...
06/18/2019

Hyperintensional Reasoning based on Natural Language Knowledge Base

The success of automated reasoning techniques over large natural-languag...
07/18/2019

Priorities in tock-CSP

The tock-CSP encoding embeds a rich and flexible approach to modelling d...
10/21/2021

FlexTOE: Flexible TCP Offload with Fine-Grained Parallelism

FlexTOE is a flexible, yet high-performance TCP offload engine (TOE) to ...
01/30/2020

VERONICA: Expressive and Precise Concurrent Information Flow Security (Extended Version with Technical Appendices)

Methods for proving that concurrent software does not leak its secrets h...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.