transactions for concurrent object-oriented programming systems  concurrent object-oriented programming systems (coops) require support for fault tolerance, concurrency control, consistent commitment of changes and program-initiated rollback. it is sometimes suggested that the classical transaction processing model successfully applied in databases and operating systems be integrated directly into coops facilities. this is clearly desirable, but by itself is too limiting. coops applications require several granularities of transaction-like facilities. a number of transaction-like mechanisms were addressed at the workshop, and no doubt there are many others suitable for coops. here i briefly survey four levels of granularity that were discussed at the workshop.  in their workshop paper linearizable concurrent objects and in [1], maurice herlihy and jeannette wing describe a fine granularity correctness condition for coops, linearizability. linearizability requires that each operation should appear to "take effect" instantaneously and that the order of non- concurrent operations should be preserved. my workshop paper concurrent meld discusses the incorporation of atomic blocks as a programming facility into the meld coops. atomic blocks in effect implement linearizability at the level of blocks (essentially compound statements, which may encompass an entire method).  in his workshop paper nested objects and in [4], bruce martin describes small grain mechanisms for both externally serializable and semantically verifiable operations for coops. externally serializable operations enforce serializability among top-level operations but permit non- serializable computations on subobjects. semantically verifiable operations do not enforce serializability at all, but instead consider the semantics of apparently conflicting operations in preventing inconsistencies from being introduced.  my paper also discusses our plans for integrating medium granularity transactions --- that is, classical transactions with atomicity and serializability as the correctness conditions --- into meld. serializable transactions have been implemented in a separate version of meld. not yet integrated into the main line. this implementation uses an algorithm for distributed optimistic concurrency control with multiple versions [2], but two phase locking, timestamps, etc. seem equally feasible for coops depending on the anticipated applications.  we are currently working on large grain transaction-like facilities for coops. our particular concern is an important class of coops applications --- open- ended activities [5] such as cad/cam. vlsi design, medical informatics, office automation and software development --- characterized by uncertain duration, uncertain developments and interaction with other concurrent activities. classical transactions are not suitable for open-ended activities for the following reasons:  fault tolerance implies atomicity, so if there is some failure, the transaction is rolled back and retried. this is entirely inappropriate when the 'transaction' consists of fixing a bug by browsing and editing a number of source files, compiling and linking, executing test cases and generating traces, etc., which may easily take several hours.  concurrency control requires that users are isolated, and the transactions appear to have been executed in some serial order. but it is not acceptable for a programmer to be locked out from editing a source file just because some other programmer had previously read the file but has not yet finished his changes to other files.  consistent commitment implies simultaneously making all of a transaction's updates publicly available only when the first transaction completes and commits. but programmers must release certain source files so they can be viewed and/or compiled and linked by other programmers cooperating on the same subsystem, while continuing in progress work on other files.  an abort deletes all changes made during the transaction, so they are never available to other transactions. a programmer may realize that his original ideas about the cause of a program error were incorrect and decide to start over, but he may want to keep his incorrectly modified versions available for reference.  thus the traditional transaction model is not suitable for open-ended activities such as software development, at least where the 'transactions' are at the granularity of bug fixes, completion of a milestone, or release of a product. an extended transaction processing model, with supporting programming facilities, is necessary for coops.  we have investigated an extended transaction model, commit-serializability, as a candidate for integration into meld and other coops. the term commit- serializability denotes a model where all committed transactions are in fact serializable in the standard sense, but these transactions may not correspond in a simple way to those transactions that were initiated. in particular, the initiated transactions may be divided during operation and parts committed separately in such ways that these transactions are not serializable.  consider two in-progress transactions t1 and t2. t1 is divided under program or user control into t3 and t4, and shortly thereafter t3 commits while t4 continues. t2 may view the committed updates of t3, some of which were made by t1 before the division, and then itself commits. t4 may then view the committed updates of t2 before it commits. t2, t3 and t4 are serializable, but t1 and t2 are not. the originally initiated transaction t1 in effect disappears, and in particular is neither committed nor aborted.  commit-serializability is supported by two new transaction processing operations, split- transaction and join-transaction [5], in addition to the standard begin-transaction, commit-transaction and abort-transaction operations. the split-transaction operation supports the kind of division described above; the inverse join-transaction operation merges a completed transaction into an in-progress transaction to commit their results together.  the two-way versions of the split and join operations take the following arguments. either statement may be executed as the last statement of any method invoked as part of a transaction t. split- transaction (a: (areadset, awriteset, amessage), b: (breadset, bwriteset, bmessage)) join-transaction (s: tid)  when the split- transaction operation is invoked during a transaction t, there is a treadset consisting of all objects read by t but not updated and a twriteset consisting of all objects updated by t. in coops, treadset is the set of instance variables read by t, including the instance variables of objects (transitively) sent a message where the responding method accessed but did not modify these instance variables of that object. twriteset is the set of instance variables assigned by t, including the instance variables of objects (transitively) sent a message where the responding method modified these instance variables of that object. in both cases, the object whose method initiated t acts as coordinator of the cohort.  treadset is divided, not necessarily disjointly, into areadset and breadset. twriteset is divided disjointly into awriteset and bwriteset; awriteset normally must also be disjoint from breadset and bwriteset from areadset. amessage and bmessage are the selectors of messages sent to the same object ($self in meld) to continue the two transactions. in the special case where a is immediately committed, amessage is the operation commit-transaction, and objects in awriteset may also appear in either breadset or bwriteset.  when the join-transaction operation is invoked during a transaction t, target transaction s must be ongoing --- and not in conflict with t. treadset and twriteset are added to sreadset and swriteset, respectively, and s may continue or commit. one difficulty of join-transaction that did not arise for split-transaction is the necessity of naming another transaction s, other than the current one t. this can be done by treating each transaction as a special object, and references to such special objects can be stored in instance variables (tid in the figure), sent as arguments in messages and even sent messages --- although these objects respond only to transaction operations. (this is orthogonal to treating different classes of transaction processing characteristics as mixin superclasses, as in avalon [3].) more work on naming issues is needed.  in the cases of both split-transaction and join-transaction, the originally initiated transaction t is divided or merged, respectively, so the net effect is as if it had never existed. the tables, logs, etc. used in the transaction manager implementation may be updated to expunge knowledge of t and replace it with knowledge of a and b or s, respectively, or this may be optimized to use t's identification for one of a or b, or for s.  g. e. kaiser