Patents by Inventor Daniel Nicolas Gisolfi

Daniel Nicolas Gisolfi has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20250138965
    Abstract: Method and apparatus for regression testing. A first plurality of sequences of events is generated by executing a plurality of test paths on a first computing environment. A test workload is constructed based on the first plurality of sequences of events. A second plurality of sequences of events is generated by executing the test workload on a second computing environment. One or more variances are identified by comparing the first plurality of sequences of events with the second plurality of sequences of events. And the second computing environment is reconfigured based on the one or more variances.
    Type: Application
    Filed: November 1, 2023
    Publication date: May 1, 2025
    Inventors: Daniel Nicolas GISOLFI, Andrew C. M. HICKS, Tyler Vezio RIMALDI
  • Publication number: 20240329923
    Abstract: A method for encoding 2D numerical data comprises determining encoding parameters for a received set of 2D numerical data and generating a set of encoded data from the set of 2D numerical data according to the encoding parameters. The encoding parameters indicate a transitional relationship among a plurality of consecutive data points and a unitization interval for sampling the first set of 2D numerical data. When generating the set of encoded data, the encoding method sets a starting point, samples the set of 2D numerical data according to the unitization interval, and determines a string as a value of each data point of the set of the encoded data. The string indicates a position of a present encoded data point in the set of the encoded data, the transitional relationship, and a difference of magnitude between a present encoded data point and an immediately preceding one.
    Type: Application
    Filed: March 30, 2023
    Publication date: October 3, 2024
    Inventors: Andrew C. M. HICKS, Stephanie Carys SHUM, Anthony Gennaro MANGIACAPRA, Marcos ARAQUE FIALLOS, Daniel Nicolas GISOLFI
  • Publication number: 20240320817
    Abstract: Techniques are provided for semiconductor defect loss mitigation. In one embodiment, the techniques involve identifying, based on an indicator, a subset of an input image of a semiconductor, generating, based on the subset of the input image, a composite defect image that represents a collection of pixels that are probabilistic drivers of a classification of a semiconductor defect, identifying, via a coordinate system, a set of potential defects of a first semiconductor, generating, based on the coordinate system and the identified set of potential defects, tags of the first semiconductor, generating, based on the tags of the first semiconductor, a potential defect image, and comparing the potential defect image to the composite defect image to determine a classification of an actual defect represented by the potential defect image.
    Type: Application
    Filed: March 24, 2023
    Publication date: September 26, 2024
    Inventors: Andrew C. M. HICKS, Michael Anthony GAGLIARDI, Nnaemeka Mcdonald ELUAGU, Daniel Nicolas GISOLFI
  • Patent number: 11853750
    Abstract: A computer-implemented method includes receiving a portion of code, inputting the received portion of code to a probabilistic data structure to determine whether the portion of code is similar to one or more other portions of code, and based on determining that the one or more other portions are similar to the received portion of code, identifying a number of similar portions of code. The method also includes storing relationship data that associates the similar portions of code with the received portion of code, determining one or more subject matter experts (SMEs) associated with the similar portions of code and the received portion of code and determining correlations between SME data and the relationship data, and storing the SME data and the correlations, the SME data including an indication of the determined SMEs, the relationship data correlating the one or more SMEs to the received portion of code.
    Type: Grant
    Filed: December 14, 2020
    Date of Patent: December 26, 2023
    Assignee: International Business Machines Corporation
    Inventors: Andrew C. M. Hicks, Robert Peter Catalano, Tyler Vezio Rimaldi, Daniel Nicolas Gisolfi
  • Patent number: 11836060
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using an initial set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, for each attribute-value pair, a non-binary success rate (SAV) is computed based on the binary execution results. in response to a success rate of an attribute-value pair being below a predetermined threshold, a subset of testcases that use the attribute-value pair is identified. Further, sets of code paths for the subset of testcases are identified, each set of code path respectively corresponding to a testcase from the subset of testcases. Further, an intersection of the sets of code paths is determined. Code paths of the SUT that are in the intersection, are highlighted to represent a soft failure with the SUT.
    Type: Grant
    Filed: October 25, 2021
    Date of Patent: December 5, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, Ryan Thomas Rawlins, Daniel Nicolas Gisolfi
  • Patent number: 11656869
    Abstract: A method of analyzing code is provided. The method includes generating an abstract representation of the code, identifying conditional statements in the abstract representation, populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement and assessing the truth table for each conditional statement to identify issues.
    Type: Grant
    Filed: November 15, 2021
    Date of Patent: May 23, 2023
    Assignee: International Business Machines Corporation
    Inventors: Andrew C. M. Hicks, Michael E. Gildein, Daniel Nicolas Gisolfi
  • Patent number: 11630663
    Abstract: Aspects of the invention include determining, by a processor, a code segment of a computer code, analyzing the code segment to determine one or more other code segments associated with the code segment, determining a set of subject matter experts (SMEs) associated with the code segment and the one or more other code segments, obtaining SME data for each SME in the set of SMEs, wherein the SME data comprises a set of attributes associated with the SME, generating, by the processor, a graphical representation of the set of attributes for each SME in the set of SMEs, transforming the graphical representations into an eigenvectors and eigenvalues, and ranking the SMEs based on their associated eigenvectors and eigenvalues.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: April 18, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Robert Peter Catalano, Tyler Vezio Rimaldi, Daniel Nicolas Gisolfi
  • Patent number: 11379352
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using an initial set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, for each attribute-value pair, a non-binary success rate (SAV) is computed based on the binary execution results. The method further includes outputting, to a user, in response to the success rate SAV of the attribute-value pair being below a predetermined threshold, an identification of one or more testcases that use the attribute-value pair, wherein the one or more testcases are to be used for diagnosing a soft failure associated with the SUT.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: July 5, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, Ryan Thomas Rawlins, Daniel Nicolas Gisolfi
  • Publication number: 20220188103
    Abstract: A computer-implemented method includes receiving a portion of code, inputting the received portion of code to a probabilistic data structure to determine whether the portion of code is similar to one or more other portions of code, and based on determining that the one or more other portions are similar to the received portion of code, identifying a number of similar portions of code. The method also includes storing relationship data that associates the similar portions of code with the received portion of code, determining one or more subject matter experts (SMEs) associated with the similar portions of code and the received portion of code and determining correlations between SME data and the relationship data, and storing the SME data and the correlations, the SME data including an indication of the determined SMEs, the relationship data correlating the one or more SMEs to the received portion of code.
    Type: Application
    Filed: December 14, 2020
    Publication date: June 16, 2022
    Inventors: Andrew C. M. Hicks, Robert Peter Catalano, Tyler Vezio Rimaldi, Daniel Nicolas Gisolfi
  • Publication number: 20220188219
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using an initial set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, for each attribute-value pair, a non-binary success rate (SAV) is computed based on the binary execution results. The method further includes outputting, to a user, in response to the success rate SAV of the attribute-value pair being below a predetermined threshold, an identification of one or more testcases that use the attribute-value pair, wherein the one or more testcases are to be used for diagnosing a soft failure associated with the SUT.
    Type: Application
    Filed: December 15, 2020
    Publication date: June 16, 2022
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, RYAN THOMAS RAWLINS, Daniel Nicolas Gisolfi
  • Publication number: 20220188205
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using an initial set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, for each attribute-value pair, a non-binary success rate (SAV) is computed based on the binary execution results. in response to a success rate of an attribute-value pair being below a predetermined threshold, a subset of testcases that use the attribute-value pair is identified. Further, sets of code paths for the subset of testcases are identified, each set of code path respectively corresponding to a testcase from the subset of testcases. Further, an intersection of the sets of code paths is determined. Code paths of the SUT that are in the intersection, are highlighted to represent a soft failure with the SUT.
    Type: Application
    Filed: October 25, 2021
    Publication date: June 16, 2022
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, Ryan Thomas Rawlins, Daniel Nicolas Gisolfi
  • Publication number: 20220188105
    Abstract: Aspects of the invention include determining, by a processor, a code segment of a computer code, analyzing the code segment to determine one or more other code segments associated with the code segment, determining a set of subject matter experts (SMEs) associated with the code segment and the one or more other code segments, obtaining SME data for each SME in the set of SMEs, wherein the SME data comprises a set of attributes associated with the SME, generating, by the processor, a graphical representation of the set of attributes for each SME in the set of SMEs, transforming the graphical representations into an eigenvectors and eigenvalues, and ranking the SMEs based on their associated eigenvectors and eigenvalues.
    Type: Application
    Filed: December 15, 2020
    Publication date: June 16, 2022
    Inventors: Andrew C. M. Hicks, Robert Peter Catalano, Tyler Vezio Rimaldi, Daniel Nicolas Gisolfi
  • Publication number: 20220075619
    Abstract: A method of analyzing code is provided. The method includes generating an abstract representation of the code, identifying conditional statements in the abstract representation, populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement and assessing the truth table for each conditional statement to identify issues.
    Type: Application
    Filed: November 15, 2021
    Publication date: March 10, 2022
    Inventors: Andrew C. M. Hicks, Michael E. Gildein, Daniel Nicolas Gisolfi
  • Patent number: 11226815
    Abstract: A method of analyzing code is provided. The method includes generating an abstract representation of the code, identifying conditional statements in the abstract representation, populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement and assessing the truth table for each conditional statement to identify issues.
    Type: Grant
    Filed: April 7, 2020
    Date of Patent: January 18, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Michael E. Gildein, Daniel Nicolas Gisolfi
  • Patent number: 11204848
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using an initial set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, for each attribute-value pair, a non-binary success rate (SAV) is computed based on the binary execution results. in response to a success rate of an attribute-value pair being below a predetermined threshold, a subset of testcases that use the attribute-value pair is identified. Further, sets of code paths for the subset of testcases are identified, each set of code path respectively corresponding to a testcase from the subset of testcases. Further, an intersection of the sets of code paths is determined. Code paths of the SUT that are in the intersection, are highlighted to represent a soft failure with the SUT.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: December 21, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, Ryan Thomas Rawlins, Daniel Nicolas Gisolfi
  • Patent number: 11188453
    Abstract: A system and related method comprise using a processor for executing a plurality of tests associated with a covering array of a test framework of the software test system on a first version of a system under test (SUT). For each of the plurality of tests, on a current test, the method comprises determining a current success rate value (SRV) for the current test that represents a success rate of the current test for the first version of the SUT. The method further comprises combining the current SRV of the first version of the SUT and current SRVs of the current test for prior versions of the SUT into a current test eigenvector associated with the current test. The method further comprises converting the current test eigenvector into a first eigenvalue that represents a health, accuracy, and quality of the first version of the SUT.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: November 30, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, Ryan Thomas Rawlins, Daniel Nicolas Gisolfi
  • Publication number: 20210311730
    Abstract: A method of analyzing code is provided. The method includes generating an abstract representation of the code, identifying conditional statements in the abstract representation, populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement and assessing the truth table for each conditional statement to identify issues.
    Type: Application
    Filed: April 7, 2020
    Publication date: October 7, 2021
    Inventors: Andrew C. M. Hicks, Michael E. Gildein, Daniel Nicolas Gisolfi
  • Patent number: 11132273
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using an initial set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, for each attribute-value pair, a non-binary success rate (SAV) is computed based on the binary execution results. An attribute is selected in response to a set of success rates corresponding to a set of attribute-value pairs that includes said attribute are all below a predetermined threshold. The set of testcases is executed using another set of test vectors using additional values for the selected attribute. For each execution of the set of testcases, for each attribute-value pair, a second non-binary success rate (SAV?) is recorded. If the predetermined threshold is now satisfied, a user is notified of the additional values for the attribute that were detected.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: September 28, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Kevin Minerley, Dale E. Blue, Ryan Thomas Rawlins, Daniel Nicolas Gisolfi
  • Patent number: 11113167
    Abstract: Inputs to a system under test (SUT) are modeled as a collection of attribute-value pairs. A set of testcases is executed using a set of test vectors that provides complete n-wise coverage of the attribute-value pairs. For each execution of the testcases, updating, for each execution of the set of testcases, for each testcase, a non-binary success rate (ST) based on the binary execution results. In response to a first success rate corresponding to a particular testcase being below a predetermined threshold, a second set of testcases is generated based on the test vectors. For each testcase, a second success rate (ST?) is computed based on a second set of execution results of a second set of testcases. In response to the second success rate corresponding to the particular testcase being substantially same as the first success rate, a user is notified of a defect in modeling the SUT inputs.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: September 7, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew C. M. Hicks, Daniel Nicolas Gisolfi, Dale E. Blue, Ryan Thomas Rawlins