Abstract: A metadata validation process that allows for deferring object model validation until after the objects are created. The process also allows for multi-threaded processing of the validation rules, thus increasing overall performance. Validation is performed by enforcing a series of validation rules on an appropriate subject. Rules are specified according to the subject that they are validating (i.e., attribute level, association level, object level or collection level). The metadata driven validation process implements several validation types on different validation units. Correctness validation rule types ensure that a validation unit satisfies all semantic rules defined for it. Completeness validation rule types ensure that a validation unit contains all the necessary data and is ready for further use. At design time, only correctness type validation is performed. Thus, the present invention advantageously allows for incomplete objects to be created at design time.

Abstract: A metadata validation process that allows for deferring object model validation until after the objects are created. The process also allows for multi-threaded processing of the validation rules, thus increasing overall performance. Validation is performed by enforcing a series of validation rules on an appropriate subject. Rules are specified according to the subject that they are validating (i.e., attribute level, association level, object level or collection level). The metadata driven validation process implements several validation types on different validation units. Correctness validation rule types ensure that a validation unit satisfies all semantic rules defined for it. Completeness validation rule types ensure that a validation unit contains all the necessary data and is ready for further use. At design time, only correctness type validation is performed. Thus, the present invention advantageously allows for incomplete objects to be created at design time.

Abstract: A method is disclosed that involves establishing a transaction stack in a memory of a computing system that is processing transactions. Two commands, PUSH and POP, operate on the stack. The PUSH command causes a frame of data identifying the currently executing transaction to be pushed onto the transaction stack. After a PUSH is executed, the first transactional statement that executes causes creation of a new autonomous transaction. If another transactional statement is executed after the new transaction commits or rolls back, but before a POP is executed, then another new autonomous transaction is created. A POP operation restores the transaction identified by the top frame of the stack. In another aspect, a programming language construct is provided for associating a lexical scope with an autonomous transaction scope. When the lexical scope is first entered during execution of the program in a first transaction, the transaction context of the first transaction is stored on a transaction stack.