2001
DOI: 10.1016/s0020-0255(01)00111-6
|View full text |Cite
|
Sign up to set email alerts
|

Virtual partition algorithm in a nested transaction environment and its correctness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2006
2006
2006
2006

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…To prove the correctness of our transaction model, firstly, a set of principles need to be proposed to formalize the concept of correctness in our system, then formal proof need to be provided to show that our transaction process satisfies each of these principles. The proof of correctness may be constructed on the basis of some formal results of logic programming (answer set semantics) as well as the standard automata theory as investigated by Lynch et al and Madria et al [27,28] in classical environments.…”
Section: Discussionmentioning
confidence: 99%
“…To prove the correctness of our transaction model, firstly, a set of principles need to be proposed to formalize the concept of correctness in our system, then formal proof need to be provided to show that our transaction process satisfies each of these principles. The proof of correctness may be constructed on the basis of some formal results of logic programming (answer set semantics) as well as the standard automata theory as investigated by Lynch et al and Madria et al [27,28] in classical environments.…”
Section: Discussionmentioning
confidence: 99%