P. Ammann, S. Jajodia, and I. Ray. Using formal methods to reason about semantics-based decomposition of transactions. Technical Report ISSE-TR-95-1XX, ISSE Dept., GMU, MS 4A4, Fairfax, VA 22180, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....important, we describe an analysis technique that bases the decomposition and the interleaving specification on the semantic correctness criterion, thereby guaranteeing that when a transaction is executed it will satisfy its specifications. A recent work that takes a similar approach to [6] is [2]. 2] uses Z logic to formalize the semantics of transactions and bases a decomposition on that formalization. 2] is updated in [17, 3] which give the design of an improved implementation of their method. The present paper goes beyond [17, 3] in that it describes a design for an assertional ....

....we describe an analysis technique that bases the decomposition and the interleaving specification on the semantic correctness criterion, thereby guaranteeing that when a transaction is executed it will satisfy its specifications. A recent work that takes a similar approach to [6] is [2] [2] uses Z logic to formalize the semantics of transactions and bases a decomposition on that formalization. 2] is updated in [17, 3] which give the design of an improved implementation of their method. The present paper goes beyond [17, 3] in that it describes a design for an assertional ....

[Article contains additional citation context not shown here]

Ammann, P., Jajodia, S., and Ray, I. Using formal methods to reason about semantic-based decomposition of transaction. In Proceedings of the Conference on Very Large Databases, 1995.

....essential to ensure that an appropriate and correct transaction is achieved, and that the updates are consistent with respect to the ICs. Relevant work is being done as in [Bonner and Kifer, 1993] Bonner and Kifer, 1996] Lin and Reiter, 1994] Lin and Reiter, 1993] Korth and Speegle, 1994] [Ammann et al. 1995], Chen and Roussopoulos, 1994b] Farrag and Ozsu, 1989] Garcia Molina, 1983] and [Ludascher et al. 1996] ffl Active databases allow for data to protect their own integrity, which makes for a more complex database semantics. Active rules are often represented by the formalism ....

Ammann, P., Jajodia, S., and Ray, I. (1995). Using formal methods to reason about semantics-based decompositions of transactions. In 21st International Conference on Very Large Data Bases (VLDB), pages 218--227, Zurich, Switzerland.

....transaction. The steps satisfy the composition property. Although Reserve is a sensitive transaction, it turns out that no additional preconditions are needed to ensure that the output r reflects a consistent state. Space limitations preclude proofs of these properties; see the appendix of [AJR95]. The refined version of the single step Cancel transaction is nearly identical to the unrefined version, except that the auxiliary variables tempassigned and tempreserved are not changed. Report is a sensitive transaction, and we establish the sensitive transaction isolation property by ....

P. Ammann, S. Jajodia, and I. Ray. Using formal methods to reason about semantics-based decomposition of transactions. Technical Report ISSE-TR-95-1XX, ISSE Dept., GMU, MS 4A4, Fairfax, VA 22180, 1995.

No context found.

Paul Ammann, Sushil Jajodia, and Indrakshi Ray. Using formal methods to reason about semantics-based decomposition of transactions. In VLDB '95: Proceedings of the Twenty-First International Conference On Very Large Data Bases, Zurich, Switzerland, September 1995. To appear.

....is typically on implementing a decomposition supplied by the database application developer, with relatively little attention to what constitutes a desirable decomposition and how the developer should obtain such a decomposition. In our research, we focus on the decomposition process itself. In [2], we introduced the notion of semantic histories and identified a number of properties which must be satisfied by a decomposition if the decomposition correctly models the original collection of transactions. We also formulated the notion of successor sets to describe efficiently the correct ....

....different transactions. Although the step by step decomposition of a single transaction may be understood in isolation, reasoning about the interleaving of these steps with other transactions, possibly also decomposed into steps, is substantially more difficult. To reason about interleavings, in [2] we introduced the notion of semantic histories which not only list the sequence of steps forming the history, but also convey information regarding the state of the database before and after execution of each step in the history. We identified several properties which semantic histories must ....

[Article contains additional citation context not shown here]

P. Ammann, S. Jajodia, and I. Ray. Using formal methods to reason about semantics-based decomposition of transactions. In Proceedings of the International Conference on Very Large Data Bases, pages 218--227, Zurich, Switzerland, September 1995.

....been used to improve performance for room status Room 1 Available Room 2 Unavailable . Room 128 Unavailable (a) Table STATUS room guests Room 2 Lafayette . Room 128 Hemingway (b) Table GUEST Figure 1. Tables for hotel example applications with long duration transactions [2, 8, 9, 11]. The organization of the paper is as follows. The next section outlines an example that is used to illustrate the rest of the paper. Section 3 explains the advantages of a semantic approach to atomicity. Section 4 gives basic definitions for multilevel transactions, and section 5 defines semantic ....

....assignment to some threat is canceled. The mission example has exactly the same formal structure as the hotel example. The analyses of the examples given in this paper are informal, but a formalization of related analyses for non secure applications is given using the Z specification language in [2]. The advantage of formalization is that greater assurance can be obtained that the necessary properties do indeed hold. For future work, we intend to automate to the extent possible the process of generating and discharging the proof obligations for a given application. Industrial level tool ....

P. Ammann, S. Jajodia, and I. Ray. Using formal methods to reason about semantics-based decomposition of transactions. In Proceedingsof the Twenty-First International Conference On Very Large Databases, pages 218--227, Zurich, Switzerland, September 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC