International Business Machines Corporation

Xiang Zu

Jing Lu

Bao Zhang

Jia Yu

Xiao Yan Tang

Jin Hong Fu

Peng Hui Jiang

Dong Hui Liu

He Huang

Jia Tian Zhong

Xing Xing Shen

Tie Liu

Yong Yin

Naijie Li

Shi Chong Ma

Ming Liu

Methods, apparatus, computer program products for handling critical problem exceptions during an execution of an application are provided. The method comprises: detecting, by one or more processing units, an occurrence of a certain type of critical problem exception during an execution of an application, the critical problem exception resulting in a termination of the application; instructing, by one or more processing units, to call a Super Handling Routine (SHR) corresponding to the type of the critical problem exception at a pre-configured address based on a pre-determined context registered by the application, the SHR being configured to handle critical problem exceptions; and handing, by one or more processing units, control to the SHR to handle the type of the critical problem exception.

Critical problem exception handling

Embodiments of the invention are directed to updating a dynamic library. Aspects include receiving an indication that the dynamic library has been updated and identifying all program modules that depend on the dynamic library. Aspects also include, for each program module that depends on the dynamic library, reassigning an application program interface (API) address for a current version of the dynamic library to an API address of the updated version of the dynamic library.

Dynamically updating a dynamic library

Aspects of the invention include computer-implemented method that includes generating a preliminary control flow graph from memory dump data and compiler listing data in response to an exception event at a computing program. Code segments associated with each block of the preliminary control flow graph are translated to Boolean statements. Each Boolean statement is determined to be either satisfied or unsatisfied based on input values retrieved from the memory dump data. An edge property value of a first edge and a second edge of a plurality of edges of the preliminary control flow graph based are calculated based on a satisfaction of the Boolean statements. The edge property value of the first edge is compared to the edge property value of the second edge. The preliminary control flow graph is refined by deleting the first edge of the plurality of edges based at least in part on the comparison.

Control flow graph refining via execution data

Provided is a method for preventing deadlocks between competing threads. The method includes receiving a lock request from a first thread and, in response, identifying a potential deadlock with a second thread. In response, the method includes determining whether to deny the lock request, which includes: determining whether a first duration for which the first thread will hold the lock to complete its job is longer than a second duration for which the second thread will hold the lock to complete its job; determining whether the second thread will start to use the lock soon relative to the first duration; and determining whether both the first and second threads will complete their respective jobs within a time limit if the lock is denied to the first thread while the second thread completes its job. The method further includes denying the request for the requested lock from the first thread.

Preventing deadlocks in runtime

Growing community of inventors

Dong Cheng District, China

Xiang Zu