Serializability is the correctness criterion generally used in the literature to determine a schedule's correctness. Such a criterion is clearly inappropriate, however, in determining the correctness of schedules that are produced when an application is run at an isolation level lower than SERIALIZABLE since such schedules might no longer be serializable. In this dissertation, using semantic-correctness criterion, we prove a condition for each isolation level under which transactions that execute at that level will be semantically correct. We also apply the semantic-correctness theory to automatic work
ow veri cation and generation problems. In particular, we propose a new work
ow model that allows to: (1) automatically check if the desired outcome of a work ow can be produced by its actual implementation, (2) automatically synthesize a work
ow implementation from the work
ow specication and a given task library. Finally, we present some preliminary theoretical results for the completeness of a task library and the realizability of a work
ow postcondition.
|
952
|
An Axiomatic Basis for Computer Programming
– Hoare
- 1969
|
|
425
|
The Science of Programming
– Gries
- 1981
|
|
413
|
The Notion of Consistency and Predicate Locks in a Database System
– Eswaran, Gray, et al.
- 1976
|
|
257
|
An Axiomatic Proof Technique for Parallel Programs I
– Owicki, Gries
- 1976
|
|
180
|
Using Semantic Knowledge for Transaction Processing in a Distributed Database
– Garcia-Molina
- 1983
|
|
174
|
Organizing long-running activities with triggers and transactions
– Dayal, Hsu, et al.
|
|
153
|
ADEPTflex – Supporting dynamic changes of workflows without losing control
– Reichert, Dadam
- 1998
|
|
128
|
Specifying and enforcing intertask dependencies
– Attie, Singh, et al.
- 1993
|
|
108
|
A critique of ansi sql isolation levels
– Berenson, Bernstein, et al.
- 1995
|
|
102
|
Logic in Computer Science: Modelling and Reasoning about Systems
– Huth, Ryan
- 2000
|
|
99
|
Transaction logic programming
– Bonner, Kifer
- 1993
|
|
98
|
Semantics-based concurrency control: Beyond commutativity
– Badrinath, Ramamritham
- 1992
|
|
89
|
ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior
– Chrysanthis, Ramamritham
- 1990
|
|
86
|
Overview of multidatabase transaction management
– Breitbart, Garcia-Molina, et al.
- 1992
|
|
78
|
Using Semantic Knowledge of Transactions to Increase Concurrency
– Farrag, Ozsu
- 1989
|
|
77
|
The ConTract Model
– Waechter, Reuter
|
|
76
|
Merging Applicationcentric and Data-centric Approaches to Support Transaction-oriented Multisystem Work ows
– Breitbart, Deacon, et al.
- 1993
|
|
75
|
Advanced rule-driven transaction management
– Klein
- 1991
|
|
74
|
Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types
– Herlihy
- 1990
|
|
68
|
Planning and acting
– McDermott
- 1978
|
|
60
|
ACTA: The SAGA continues
– Chrysanthis, Ramamritham
- 1992
|
|
57
|
multilevel atomicity: A new correctness criterion for database concurrency control
– Lynch
- 1983
|
|
57
|
Specification and management of extended transactions in a programmable transaction environment
– Georgakopoulos, Hornick, et al.
- 1994
|
|
54
|
A Knowledge-based Approach to Handling Exceptions
– Klein, Dellarocas
|
|
46
|
The Mentor Project: Steps Towards EnterpriseWide Work ow Management
– Wodtke, Weissenfels, et al.
- 1996
|
|
40
|
Modeling long-running activities as nested sagas
– Garcia-Molina, Gawlick, et al.
- 1991
|
|
39
|
Synthesizing distributed constrained events from transactional workflow specifications
– Singh
- 1996
|
|
36
|
A framework for formalizing inconsistencies and deviations in human-centered systems
– Cugola, Nitto, et al.
- 1996
|
|
30
|
Failure Handling and Coordinated Execution of Concurrent Workflows
– Kamath, Ramamritham
- 1998
|
|
29
|
Contracts - a low-level mechanism for building general-purpose workflow management systems
– Reuter, Schwenkreis
- 1995
|
|
22
|
Nested Transactions: An Approach to Reliable Computing
– Moss
- 1981
|
|
21
|
Advanced transaction models - survey and critique
– Mohan
- 1994
|
|
21
|
Workflow Management Systems for Process Organisations
– Schael
- 1998
|
|
18
|
The concurrency control problem in multidatabases: Characteristics and solutions, proceeding
– Mehrotra, Rastogi, et al.
- 1992
|
|
17
|
American National Standard for Information Systems{Database Language{ SQL
– 135-1992
- 1992
|
|
13
|
Design and performance of an assertional concurrency control system
– Bernstein, Gerstl, et al.
- 1998
|
|
13
|
Flowback: Providing backward recovery for workflow systems
– Kiepuszewski, Muhlberger, et al.
- 1998
|
|
12
|
High performance transaction systems using transaction semantics
– Bernstein, Lewis
- 1996
|
|
11
|
Multi-level Transactions and Open Nested Transactions
– Weikum, Schek
- 1991
|
|
9
|
Speci cation and management of extended transactions in a programmable transaction environment
– Georgakopoulos, Hornick, et al.
- 1994
|
|
9
|
Veri of Work Nets
– Aalst
- 1997
|
|
8
|
A concurrency control for step-decomposed transactions
– Bernstein, Gerstl, et al.
- 1999
|
|
8
|
Logic based modeling and analysis of work
– Davulcu, Kifer, et al.
- 1998
|
|
7
|
Modeling and analysis of work using petri nets
– Adam, Atluri, et al.
- 1998
|
|
7
|
Using transaction semantics to increase performance
– Bernstein, Gerstl, et al.
- 1999
|
|
7
|
On transactional work
– Sheth, Rusinkiewicz
- 1993
|
|
6
|
Logic representation of processes in work activity coordination
– Wainer
- 2000
|
|
5
|
Software tools for a process handbook
– Bernstein, Dellaracas, et al.
- 1995
|
|
4
|
Defeasible work its computation and exception handling
– Luo, Sheth, et al.
- 1998
|
|
3
|
Advanced Transaction Models in Work Contexts
– Alonso, Agrawal, et al.
- 1996
|
