Specifying Transaction Control to Serialize Concurrent Program Executions

06/06/2017
by   Egon Börger, et al.
0

We define a programming language independent transaction controller and an operator which when applied to concurrent programs with shared locations turns their behavior with respect to some abstract termination criterion into a transactional behavior. We prove the correctness property that concurrent runs under the transaction controller are serialisable. We specify the transaction controller TaCtl and the operator TA in terms of Abstract State Machines. This makes TaCtl applicable to a wide range of programs and in particular provides the possibility to use it as a plug-in when specifying concurrent system components in terms of Abstract State Machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2017

Serialisable Multi-Level Transaction Control: A Specification and Verification

We define a programming language independent controller TaCtl for multi-...
research
05/02/2022

Reversing an Imperative Concurrent Programming Language

We introduce a method of reversing the execution of imperative concurren...
research
04/27/2019

A Practical Analysis of Rust's Concurrency Story

Correct concurrent programs are difficult to write; when multiple thread...
research
01/07/2020

A Behavioural Theory of Recursive Algorithms

“What is an algorithm?” is a fundamental question of computer science. G...
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...
research
09/13/2018

Improving the Parallel Execution of Behavior Trees

Behavior Trees (BTs) have become a popular framework for designing contr...
research
02/08/2018

Stubborn Transaction Reduction (with Proofs)

The exponential explosion of parallel interleavings remains a fundamenta...

Please sign up or login with your details

Forgot password? Click here to reset