Abstract: An apparatus includes a computer network including at least one auction server, at least one seller client and at least one buyer client. The at least one auction server, the at least one seller client and the at least one buyer client are executing on a computer system a synthetic continuous double auction having contingent bidding on a plurality of heterogeneous item auctions. The synthetic continuous double auction includes a composite reverse auction, defined to include a bid set including a first contingent bid on a first of the plurality of heterogeneous item auctions and a second contingent bid on a second of the plurality of heterogeneous item auctions, is ended when i) the first contingent bid from the bid set is recognized as a winning bid and substantially simultaneously ii) the second contingent bid from the bid set is withdrawn as a remaining bid.

Abstract: Methods, systems and data structures are described for conducting synthetic continuous double auctions. A method includes participating in a synthetic continuous double auction having contingent bidding on a plurality of heterogeneous item auctions. A composite reverse auction, defined by a bid set including a first contingent bid on a first of the plurality of heterogeneous item auctions and a second contingent bid on a second of the plurality of heterogeneous item auctions, is ended when i) the first contingent bid from the bid set is recognized as a winning bid and substantially simultaneously ii) the second contingent bid from the bid set is withdrawn as a remaining bid.

Abstract: A dictionary in a distributed transaction processing system. The dictionary is implemented as an escrow-locking multithreaded process-pair resource manager (PPRM) dictionary which is produced as an escrow-locking object implemented in the context of a PPRM and inheriting its functionality. A process pair in the PPRM is responsive to multiple concurrent transactions and including a concurrent aspect, a serial aspect and an escrow-locking dictionary. The concurrent aspect is a front-end multithreaded process of the process pair for concurrently servicing the multiple concurrent transactions. The serial aspect is a single-threaded process of the process pair for serializing the multiple concurrent transaction. Each of the concurrent aspect and the serial aspect includes an instance of the escrow-locking dictionary. That is, each of the concurrent aspect and the serial aspect has it own copy of the escrow-locking dictionary and, combined, the two copies maintains an appearance of a single virtual dictionary.

Abstract: A system and method that implement a strategy for automatically generating self-checking tests of source-to-source translation. The tests make certain that software components produced by a source-to-source computer language translator continue to be binary-compatible with all other software components with which they previously interacted correctly, including components that remain in the original programming language. To that end, the correctness of procedure interfaces in a target computer program is also verified. With this strategy, correct translation of text preprocessor mechanisms such as macros, conditionally compiled regions of code, and source file inclusion can be achieved. The target program is the result of translating a source program written in a different language from the target program. The system creates a set of procedure calls to each procedure in the source program. The system also creates a set of callable procedures with the same interface specification as in the source program.

Abstract: A system for identifying the file structure of a computer program, preserving the file structure of the code after translation of source code from one high-level computer language to another, combining pieces of a source file that were generated in different translation sessions, and ensuring textual consistency of each piece of generated code in the resultant code files.

Abstract: A shared bag, for collecting objects used in object oriented programming, implemented as a process pair resource manager intended to provide concurrent access to multiple threads. The process-pair implementation includes a concurrent aspect and a serial aspect. Each thread gains concurrent access to the shared bag through a registered transaction. The multiple threads can concurrently access the shared bag by passing messages to the concurrent aspect in order to add objects to, or remove objects from the shared bag. The concurrent aspect adds a description of each message, as well as the result of processing each message, to a transaction record associated with the transaction under which the thread is registered. The identity of each removed object is also recorded by the concurrent aspect in the transaction record. At the conclusion of a transaction, the concurrent aspect passes the transaction record to the serial aspect. The serial aspect then replays the transaction, using the transaction record.

Abstract: The present invention is a process-pair resource manager for use in a transaction processing system. The process-pair resource manager includes a concurrent aspect and a serial aspect. The concurrent aspect provides an object-like interface to a protected resource. An application program participating in a transaction accesses the protected resource by passing messages to the concurrent aspect. The concurrent aspect adds a description of each message as well as the result of processing each message to a transaction record. At the conclusion of a transaction, the concurrent aspect passes the transaction record to the serial aspect. The serial aspect then replays the transaction, using the transaction record. If the replay of the transaction is consistent with the transaction as recorded in the transaction record, the serial aspect sends a message to the concurrent aspect voting to commit the transaction. In turn, the concurrent aspect sends a message to the transaction manager forwarding the commit message.

Abstract: The present invention is a scalar quantity implemented as a process-pair resource manager. The process-pair implementation includes a concurrent aspect and a serial aspect. The concurrent aspect provides an object-like interface to the scalar quantity. Threads and processes access the scalar quantity by passing messages to the concurrent aspect. The concurrent aspect adds a description of each message as well as the result of processing each message to a transaction record. At the conclusion of a transaction, the concurrent aspect passes the transaction record to the serial aspect. The serial aspect then replays the transaction, using the transaction record. If the replay of the transaction is consistent with the transaction as recorded in the transaction record, the serial aspect sends a message to the concurrent aspect voting to commit the transaction. In turn, the concurrent aspect sends a message to the transaction manager forwarding the commit message.

Abstract: A method, system, apparatus, and program for translating one computer language to another using doubly-rooted tree data structures. A doubly-rooted tree is the combination of two sets of hierarchically related objects sharing a common set of leaves. An N-rooted tree is also described. When a doubly-rooted tree is constructed in the specified manner and then translated to a second doubly-rooted tree, source language code is transformed into target language code. In addition, the translation preserves preprocessor characteristics of the source language code including macros, conditionally compiled regions of code, source inclusion statements, and comments.

Abstract: A method and apparatus for translating source code written in one computer language to source code written in another language wherein translated static fragments are generated in the face of textual inconsistencies. Exactly one target language definition of each source language static fragment is generated and the differences are encapsulated in new parameters.

Abstract: A method and apparatus for translating source code written in one computer language to source code written in another language wherein translated static fragments are generated in the face of textual inconsistencies. Exactly one target language definition of each source language static fragment is generated and the differences are encapsulated in new parameters.

Abstract: A method, system, apparatus, and program for translating one computer language to another using doubly-rooted tree data structures. A doubly-rooted tree is the combination of two sets of hierarchically related objects sharing a common set of leaves. An N-rooted tree is also described. When a doubly-rooted tree is constructed in the specified manner and then translated to a second doubly-rooted tree, source language code is transformed into target language code. In addition, the translation preserves preprocessor characteristics of the source language code including macros, conditionally compiled regions of code, source inclusion statements, and comments.