First-Order Dynamic Logic for Compensable Processes

Abstract : Compensable programs offer a convenient paradigm to deal with long-running transactions, because they offer a structured and modular approach to the composition of distributed transactional activities, like services. The basic idea is that each activity has its own compensation and that the compensable program fixes the order of execution of such activities. The main problem is how to guarantee that if one or even many faults occur then the compensations are properly executed so to reach a consistent configuration of the system. We propose a formal model for such problems based on a concurrent extension of dynamic logic that allows us to distill the hypothesis under which the correctness of compensable programs can be ensured. The main result establishes that if basic activities have a correct compensation we can show the correctness of any compound compensable program. Moreover, we can use dynamic logic to reason about behavioural and transactional properties of programs.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01529601
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 31, 2017 - 10:00:04 AM
Last modification on : Monday, September 9, 2019 - 11:24:02 AM
Long-term archiving on : Wednesday, September 6, 2017 - 3:05:59 PM

File

978-3-642-30829-1_8_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Roberto Bruni, Carla Ferreira, Anne Kersten Kauer. First-Order Dynamic Logic for Compensable Processes. 14th International Conference on Coordination Models and Languages (COORDINATION), Jun 2012, Stockholm, Sweden. pp.104-121, ⟨10.1007/978-3-642-30829-1_8⟩. ⟨hal-01529601⟩

Share

Metrics

Record views

84

Files downloads

344