PATENT CLAIM ANALYSIS

Application Number: 15871955
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2019-07
Patent Classification: ["717", "131000"]

Abstract:
A method of branch exploration in fuzz testing of software binaries includes receiving a set of inputs of a binary program under analysis (BPUA) discovered during testing by a grey box fuzzer. The method includes re-executing the set of inputs. The method includes re-executing a concrete execution of the set of inputs in the BPUA and formation of a constraints tree in which path constraints along paths of the BPUA and conditions at branch points are recorded and marked as explored or unexplored. The method includes selecting a particular number of the unexplored branches of the BPUA. The method includes solving the particular number of unexplored branches with a constraint solver to generate a new set of the particular number of inputs. The method includes communicating the new set of the particular number of inputs to the grey box fuzzer for exploration of different branches of the BPUA.

Claim (Index 8):
The method of  claim 7 , wherein after the constraints tree is stored in the graph database, the re-executing includes:\n determining whether a concrete valuation of an input of the set of inputs leads to a particular branch; and in response to the concrete valuation of the input leading to the particular branch: determining whether an alternative branch to the particular branch is present in the constraints tree; in response to the alternative branch not being present in the constraints tree, querying the graph database for the alternative branch; in response to the alternative branch not being present in the graph database and not being present in the constraints tree, adding the alternative branch to both the graph database and the constraints tree; in response to the alternative branch not being present in the graph database and marked as unexplored, loading the alternative branch to the constraints tree; and in response to the constraints tree being explored, deleting the constraints tree, querying the graph database for unexplored branches, and loading unexplored branches to RAM.

Metadata:
- Claim Count in Document: 24.0
- Percentile: 86.0
- Lexical Diversity: 2.36364
- Patent Class: 717.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['12722404', '13345585', '13587423', '12957391', '11323032']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3427514398497228
- 35 USC 102 Novelty (BERT): 0.4923893058476125
- Combined Prediction Score: 0.3577152264495117
- Mean Citation Score: 156.76236
- Max Citation Score: 166.00107
- Similarity Product: 123.63027033657433

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test