Patent application number | Description | Published |
20150095710 | DEBUGGER TIMED THREAD RELEASE - A method for debugging a program having a plurality of threads includes identifying, for each thread, a target point at which the program terminated and a staging point previously executed in the thread. The method further includes executing each thread from the staging point to the target point and determining, for each thread, a staging time based upon the executing of each thread from the staging point to the target point. The method further includes executing each thread from its staging point based on the staging time of the thread so that the plurality of threads will reach the crash location at approximately the same time such that the program threads execute in a similar pattern to the execution that caused the crash. | 04-02-2015 |
20150205729 | CONTROLLING DIRECT MEMORY ACCESS PAGE MAPPINGS - A method for controlling access to a memory of a computer system configured with at least one logical partition may include receiving a first request to map a first page of the memory, the request identifying a first requester. A first logical partition associated with the first page may be determined. It may be determined that an attribute of the first logical partition limits access to individual pages of the first logical partition to a single requester, and that the first page is available to be mapped to a requester. The first page may be mapped to the first requester and a flag indicating that the first page is unavailable for an additional mapping may be set. The first request may be from a device driver on behalf of an input/output adapter, as the first requester, to use the first page in a direct memory access transfer. | 07-23-2015 |
20150205738 | CONTROLLING DIRECT MEMORY ACCESS PAGE MAPPINGS - A method for controlling access to a memory of a computer system configured with at least one logical partition may include receiving a first request to map a first page of the memory, the request identifying a first requester. A first logical partition associated with the first page may be determined. It may be determined that an attribute of the first logical partition limits access to individual pages of the first logical partition to a single requester, and that the first page is available to be mapped to a requester. The first page may be mapped to the first requester and a flag indicating that the first page is unavailable for an additional mapping may be set. The first request may be from a device driver on behalf of an input/output adapter, as the first requester, to use the first page in a direct memory access transfer. | 07-23-2015 |
20150309776 | IDENTIFYING POTENTIALLY UNINITIALIZED SOURCE CODE VARIABLES - Computer program source code is represented by nodes in a control flow graph. A set of target nodes is identified, where each node in the set of target nodes includes at least one line of source code that defines a modification to a particular variable used in the computer program. A usage score relating to the variable is calculated for each target node. Each usage score is then recalculated based on the earlier scores and also based on the modifications to the variable that are defined by the lines of source code. Each recalculated score is compared to its corresponding earlier score, and if any score has changed, then the process repeats. Scores are recalculated based on the most recently calculated scores until the scores stop changing. The final scores may then be displayed. | 10-29-2015 |
20150309913 | IDENTIFYING POTENTIALLY UNINITIALIZED SOURCE CODE VARIABLES - Computer program source code is represented by nodes in a control flow graph. A set of target nodes is identified, where each node in the set of target nodes includes at least one line of source code that defines a modification to a particular variable used in the computer program. A usage score relating to the variable is calculated for each target node. Each usage score is then recalculated based on the earlier scores and also based on the modifications to the variable that are defined by the lines of source code. Each recalculated score is compared to its corresponding earlier score, and if any score has changed, then the process repeats. Scores are recalculated based on the most recently calculated scores until the scores stop changing. The final scores may then be displayed. | 10-29-2015 |
20150319126 | AD HOC MESSAGE SHARING BETWEEN EMAIL AND SOCIAL NETWORKS - There are provided a system, a method and a computer program product for sharing messages between an email client and a social network. The system prepares, based on an input from a sender, an email message by using the email client. The system identifies a portion of the email message to be shared with one or more users in the social network. The system tags the portion of the email message with identities of the one or more users in the social network. The system accesses the social network with credential of the sender. The system posts the portion of the email message on social network pages of the one or more users under a name of the sender. | 11-05-2015 |
20150319127 | AD HOC MESSAGE SHARING BETWEEN EMAIL AND SOCIAL NETWORKS - There are provided a system, a method and a computer program product for sharing messages between an email client and a social network. The system prepares, based on an input from a sender, an email message by using the email client. The system identifies a portion of the email message to be shared with one or more users in the social network. The system tags the portion of the email message with identities of the one or more users in the social network. The system accesses the social network with credential of the sender. The system posts the portion of the email message on social network pages of the one or more users under a name of the sender. | 11-05-2015 |
20150339470 | MANAGING COMPROMISED PASSWORDS - A system and computer implemented method for determining compromised passwords is disclosed. The method may include displaying, in a first set of positions, a set of entry keys of a device. The method may include collecting a first set of tracking data including the first set of positions for entry of a first password. The method may also include displaying the set of entry keys of the device in a second set of positions. The method may also include determining a second password based on the second set of positions and entry of the first password. The method may also include determining whether the second password was entered into the device. | 11-26-2015 |