Results 1  10
of
2,211
The Correctness Criterion for Deferred Update Replication
"... In this paper we propose updaterealtime opacity, a new correctness criterion based on opacity, that precisely describes the guarantees offered by Deferred Update Replication (DUR) protocol. We specify updaterealtime opacity as a member of the opacity family of properties, which we also intro ..."
Abstract
 Add to MetaCart
In this paper we propose updaterealtime opacity, a new correctness criterion based on opacity, that precisely describes the guarantees offered by Deferred Update Replication (DUR) protocol. We specify updaterealtime opacity as a member of the opacity family of properties, which we also
Quadratic correctness criterion for Non commutative Logic
 IN 15TH INT. WORKSHOP ON COMPUTER SCIENCE LOGIC, CSL 2001, LNCS 2142
, 2001
"... The multiplicative fragment of Non commutative Logic (MNL) has a proof nets theory [AR00] with a correctness criterion based on long trips for cutfree proof nets. Recently, R.Maieli has developed another criterion in the DanosRegnier style [Mai00]. Both are in exponential time. We give a quadratic ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The multiplicative fragment of Non commutative Logic (MNL) has a proof nets theory [AR00] with a correctness criterion based on long trips for cutfree proof nets. Recently, R.Maieli has developed another criterion in the DanosRegnier style [Mai00]. Both are in exponential time. We give a
QUASI SERIALIZABILITY: A CORRECTNESS CRITERION FOR INTERBASE
, 1988
"... In h i s paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent t o a quasi serial history in which global transactions are submitted seriall ..."
Abstract
 Add to MetaCart
In h i s paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent t o a quasi serial history in which global transactions are submitted
Quasi serializability: A Correctness Criterion for Global Concurrency Control in InterBase
 In Proceedings of the Fifteenth International Conference on Very Large Databases
, 1989
"... In his paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent to a quasi serial history in which global transactions are submitted serially. ..."
Abstract

Cited by 89 (11 self)
 Add to MetaCart
In his paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent to a quasi serial history in which global transactions are submitted serially
A correctness criterion free from switchings
"... We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criterion generalizes a criterion recently introduced by Mogbil and Jacobé de Naurois in order to characterize the space complexity of the correctness problem for M(E)LL: while the MogbilNaurois criterion r ..."
Abstract
 Add to MetaCart
We present a new correctness criterion for Multiplicative Linear Logic (MLL) proof nets. Our criterion generalizes a criterion recently introduced by Mogbil and Jacobé de Naurois in order to characterize the space complexity of the correctness problem for M(E)LL: while the MogbilNaurois criterion
An Algebraic Correctness Criterion for Intuitionistic ProofNets
, 1997
"... this paper, we formulate a new criterion, which is intrinsically intuitionistic. This criterion consists in decorating the proofstructures with algebraic terms that must obey some constraints reminiscent of phase semantics. These constraints are deøned according to the polarities of the proofstruc ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
this paper, we formulate a new criterion, which is intrinsically intuitionistic. This criterion consists in decorating the proofstructures with algebraic terms that must obey some constraints reminiscent of phase semantics. These constraints are deøned according to the polarities of the proof
A Correctness Criterion for Asynchronous Circuit Validation and Optimization
, 1992
"... In order to reason about the correctness of asynchronous circuit implementations and specifications, Dill has developed a variant of trace theory[ 1]. Tracetheory describes the behavior of an asynchronous circuit by representing its possible executions as strings called"traces". A useful ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
In order to reason about the correctness of asynchronous circuit implementations and specifications, Dill has developed a variant of trace theory[ 1]. Tracetheory describes the behavior of an asynchronous circuit by representing its possible executions as strings called"traces". A
Minimality of the Correctness Criterion for Multiplicative Proof Nets
 Mathematical Structures in Computer Science
, 1993
"... this paper concludes that for multiplicative linear logic, proofstructures that are not correct (i.e. with respect to the criterion) and that do not contain any cut are bad with respect to point 4. In other words, this proof means that it is not possible to nd a bigger class of proofstructures with ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper concludes that for multiplicative linear logic, proofstructures that are not correct (i.e. with respect to the criterion) and that do not contain any cut are bad with respect to point 4. In other words, this proof means that it is not possible to nd a bigger class of proof
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase*
"... In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent to a quasi serial history in which global transactions are submitted seriall ..."
Abstract
 Add to MetaCart
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent to a quasi serial history in which global transactions are submitted
A New Correctness Criterion for Multiplicative Non Commutative Proof Nets
, 2001
"... We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the noncommutative counterpart to the DanosRegnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net (obtained by mutil ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the noncommutative counterpart to the DanosRegnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net (obtained
Results 1  10
of
2,211