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 1):
A method of branch exploration in fuzz testing of software binaries, the method comprising:\n receiving, by a symbolic execution engine, a set of inputs of a binary program under analysis (BPUA) that is discovered during testing by a grey box fuzzer; re-executing, by the symbolic execution engine, the set of inputs, the re-executing including 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 either explored or unexplored; storing the constraints tree in random access memory; in response to an amount of memory dedicated to the constraints tree exceeding a particular threshold:\n storing the constraints tree in a graph database; \n selecting, by the symbolic execution engine, a particular number of the unexplored branches of the BPUA; solving, by the symbolic execution engine, the particular number of the unexplored branches with a constraint solver to generate a new set of the particular number of inputs; communicating, by the symbolic execution engine, the new set of inputs to the grey box fuzzer for exploration of one or more different branches of the BPUA, the new set of inputs including the particular number of new inputs; and deleting a sub-tree of the constraints tree.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3160168772921507
- 35 USC 102 Novelty (BERT): 0.4921797421144414
- Combined Prediction Score: 0.3336331637743798
- Mean Citation Score: 156.76236
- Max Citation Score: 166.00107
- Similarity Product: 121.46327038003564

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

Dataset: test