Abstract: A method of queuing messages for communications between a first computer program and a second computer program, comprises: placing a plurality of messages in a queue, wherein each message has a message body; placing selector information on each message, wherein the selector information contains information as to which message is to be processed next; and using the selector information on a message to identify a next message for processing.

Abstract: A method, apparatus, and a computer program product are disclosed for selectively activating a trace function in a computer program in response to a call of a predetermined trigger code element so that trace data is produced only for those subroutines that call the trigger code element or are called by the trigger code element. The computer program product provides one or more trace code elements for one or more selected subroutines of the computer program stored on internal memory of a digital computer. The trace code elements provide trace data for said selected subroutines. The computer program product also selects a subroutine as a trigger code element, processes the computer program, monitors the call stack for the trigger code element, and enables the trace code elements for each selected subroutine simultaneously present in the call stack if the trigger code element is identified in the call stack.

Abstract: A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.

Abstract: After a client device issues a request, a verification stub component receives the request. Then, the verification stub component obtains a current state of the client device from a client state table. The verification stub component evaluates whether the request is valid or not by analyzing a content and context of the request and checking the request against a protocol matrix. If the request is valid, the verification stub component updates the current state of the client device in the current state table, and forwards the request to a server device. Otherwise, the verification stub component creates a report describing the request is invalid, and evaluates whether the server can process the request. If the server cannot process the request, the verification stub component interrupts the request and forwards the report to the client device. Otherwise, the verification stub component provides the request to the server device.

Abstract: A method and system for preserving a message ordering while processing message are discussed. A message ordering manager records an order in which electronic messages arrive at an input queue. An application server processes the electronic messages out-of-order or in parallel. The message ordering manager commits the processed electronic messages in the order in which electronic messages arrive at an input queue. If a processed message cannot be committed because older message(s) are not completely processed, then application server determines whether processing older message(s) is critical or not. If the processing the older message(s) is critical, the application server rolls back the processed message and the older message(s). Otherwise, the message ordering manager commits the processed message before the older electronic messages are committed.

Abstract: A method of queuing messages for communications between a first computer program and a second computer program, comprises: placing a plurality of messages in a queue, wherein each message has a message body; placing selector information on each message, wherein the selector information contains information as to which message is to be processed next; and using the selector information on a message to identify a next message for processing.

Abstract: A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.

Abstract: After a client device issues a request, a verification stub component receives the request. Then, the verification stub component obtains a current state of the client device from a client state table. The verification stub component evaluates whether the request is valid or not by analyzing a content and context of the request and checking the request against a protocol matrix. If the request is valid, the verification stub component updates the current state of the client device in the current state table, and forwards the request to a server device. Otherwise, the verification stub component creates a report describing the request is invalid, and evaluates whether the server can process the request. If the server cannot process the request, the verification stub component interrupts the request and forwards the report to the client device. Otherwise, the verification stub component provides the request to the server device.

Abstract: A method and system for preserving a message ordering while processing message are discussed. A message ordering manager records an order in which electronic messages arrive at an input queue. An application server processes the electronic messages out-of-order or in parallel. The message ordering manager commits the processed electronic messages in the order in which electronic messages arrive at an input queue. If a processed message cannot be committed because older message(s) are not completely processed, then application server determines whether processing older message(s) is critical or not. If the processing the older message(s) is critical, the application server rolls back the processed message and the older message(s). Otherwise, the message ordering manager commits the processed message before the older electronic messages are committed.

Abstract: A method, apparatus, and a computer program product are disclosed for selectively activating a trace function in a computer program in response to a call of a predetermined trigger code element so that trace data is produced only for those subroutines that call the trigger code element or are called by the trigger code element. The computer program product provides one or more trace code elements for one or more selected subroutines of the computer program stored on internal memory of a digital computer. The trace code elements provide trace data for said selected subroutines. The computer program product also selects a subroutine as a trigger code element, processes the computer program, monitors the call stack for the trigger code element, and enables the trace code elements for each selected subroutine simultaneously present in the call stack if the trigger code element is identified in the call stack.