Fifth International Conference on Very Large Data Bases, 1979.
DOI: 10.1109/vldb.1979.718144
|View full text |Cite
|
Sign up to set email alerts
|

Proving Consistency Of Database Transactions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 5 publications
0
10
0
Order By: Relevance
“…Their method can deal with aggregate constraints directly. Gardarin and Melkanoff (1979) introduced a powerful ALGOL-like language (with Hoare-style axiomatic semantics) for transactions that allowed multiple updates as well as updates within a loop construct. They performed manual theorem proving to demonstrate the consistency preservation of transactions, and did not deal with test generation.…”
Section: Constraint Enforcement Methods Constraint Enforcement Methodmentioning
confidence: 99%
“…Their method can deal with aggregate constraints directly. Gardarin and Melkanoff (1979) introduced a powerful ALGOL-like language (with Hoare-style axiomatic semantics) for transactions that allowed multiple updates as well as updates within a loop construct. They performed manual theorem proving to demonstrate the consistency preservation of transactions, and did not deal with test generation.…”
Section: Constraint Enforcement Methods Constraint Enforcement Methodmentioning
confidence: 99%
“…In the second case, the responsibility for integrity control is part of the transaction design process [38,92]. Again, changes to constraint definitions require modification of all transactions including integrity control with respect to these definitions.…”
Section: The Integrity Conceptmentioning
confidence: 99%
“…If the transaction is found to be inconsistent, it is simply rejected. In [38], the consistency of transactions is analyzed with Hoare's axiomatic approach to program correctness. In [92] a knowledge-based approach is described.…”
Section: Safe( T)c~(vd E ~ )(5~(d ) ~ ~(D T(d )))mentioning
confidence: 99%
“…This approach obviously needs a more practical counterpart. Gardarin and Melkanoff [1979] offer a partial answer, using Hoare's logic rather than dynamic logic.…”
Section: Proving Consistency Of Transactionsmentioning
confidence: 99%