COO-Serializability (COO-SR) is a weaker form of correctness than serializability that allows transactions to cooperate by exchanging data during their execution. Potential benefits of COO-SR include the extension of transactional approach to new advanced applications like design environments or workflow management. The principle of COO-SR is to prove the correctness of an execution on a subset of this execution history\,: under some hypothesis, serializability of this sub-history is sufficient to prove the correctness of the entire execution. This paper describes this correctness criterion and a corresponding protocol implemented in the context of a design frameworks.
%0 Report
%1 molli97a
%A Molli, Pascal
%A Munier, Manuel
%A Canals, Gérôme
%A Charoy, Francois
%A Godart, Claude
%D 1997
%K ACTA Concurrency Control, Cooperative Correctness Criterion, Execution,
%T COO-serializability\,: A Correctness Criterion for Cooperative Executions
%X COO-Serializability (COO-SR) is a weaker form of correctness than serializability that allows transactions to cooperate by exchanging data during their execution. Potential benefits of COO-SR include the extension of transactional approach to new advanced applications like design environments or workflow management. The principle of COO-SR is to prove the correctness of an execution on a subset of this execution history\,: under some hypothesis, serializability of this sub-history is sufficient to prove the correctness of the entire execution. This paper describes this correctness criterion and a corresponding protocol implemented in the context of a design frameworks.
@techreport{molli97a,
abstract = {COO-Serializability (COO-SR) is a weaker form of correctness than serializability that allows transactions to cooperate by exchanging data during their execution. Potential benefits of COO-SR include the extension of transactional approach to new advanced applications like design environments or workflow management. The principle of COO-SR is to prove the correctness of an execution on a subset of this execution history\,: under some hypothesis, serializability of this sub-history is sufficient to prove the correctness of the entire execution. This paper describes this correctness criterion and a corresponding protocol implemented in the context of a design frameworks.},
added-at = {2007-06-19T16:03:11.000+0200},
author = {Molli, Pascal and Munier, Manuel and Canals, G{\'e}r{\^o}me and Charoy, Fran\c{c}ois and Godart, Claude},
biburl = {https://www.bibsonomy.org/bibtex/2a6a275420fb7ba5d468d0e8bcd4c4494/charoy},
category = {15},
crinnumber = {97-R-071},
equipe = {ECOO},
interhash = {9e2c39198fa1005133ded9358ffb2558},
intrahash = {a6a275420fb7ba5d468d0e8bcd4c4494},
keywords = {ACTA Concurrency Control, Cooperative Correctness Criterion, Execution,},
timestamp = {2007-06-19T16:03:12.000+0200},
title = {COO-serializability\,: A Correctness Criterion for Cooperative Executions},
type = {Rapport de recherche},
year = { 1997}
}