Abstract: A computer-implemented method includes identifying a bad fix to a software product, where the software product includes a plurality of parts, and where the bad fix presents an error into a first part. A plurality of fixes to the software product, including the bad fix, are representable by a dependency graph indicating dependencies among the plurality of fixes. The dependency graph is recursively traversed to identify a subset of fixes that are dependent on the bad fix, where each fix in the subset of fixes includes a respective set of parts, and to add a reference to a respective most recent version of each part of each fix in the subset of fixes to a parts datastore. A remedial part and each part referenced in the parts datastore are packaged into a remedial fix, where the remedial part includes a correction to the error in the first part.

Abstract: A method and system for processing a plurality of unordered software patches for one or more computer readable software programs configured to be executed in a computer system. The unordered software patches are obtained. The unordered software patches include relationship information for defining a relationship the unordered software patches have with a second software patch. For each unordered software patch, the relationship information of the unordered software patch is analyzed to determine the relationship the unordered software patch has with the second software patch. An entry for each unordered software patch is stored in a relationship data store in the data processing system or computer system. The entry comprises dependency data representative of the determined relationship the unordered software patch has with the second software patch. The unordered software patches are ordered based on the dependency data in the relationship data store.

Abstract: A computer-implemented method includes identifying a bad fix to a software product, where the software product includes a plurality of parts, and where the bad fix presents an error into a first part. A plurality of fixes to the software product, including the bad fix, are representable by a dependency graph indicating dependencies among the plurality of fixes. The dependency graph is recursively traversed to identify a subset of fixes that are dependent on the bad fix, where each fix in the subset of fixes includes a respective set of parts, and to add a reference to a respective most recent version of each part of each fix in the subset of fixes to a parts datastore. A remedial part and each part referenced in the parts datastore are packaged into a remedial fix, where the remedial part includes a correction to the error in the first part.

Abstract: A method and system for processing a plurality of unordered software patches for one or more computer readable software programs configured to be executed in a computer system. The unordered software patches are obtained. The unordered software patches include relationship information for defining a relationship the unordered software patches have with a second software patch. For each unordered software patch, the relationship information of the unordered software patch is analyzed to determine the relationship the unordered software patch has with the second software patch. An entry for each unordered software patch is stored in a relationship data store in the data processing system or computer system. The entry comprises dependency data representative of the determined relationship the unordered software patch has with the second software patch. The unordered software patches are ordered based on the dependency data in the relationship data store.