PATENT CLAIM ANALYSIS

Application Number: 15865699
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2019-07
Patent Classification: ["711", "100000"]

Abstract:
Detecting and providing notice of non-faulting memory accesses during prior execution of an application based on a replay-able trace of the application's execution. Embodiments include replaying portion(s) of prior execution of the application from a replay-able trace the application's prior execution, while tracking lifetime of memory region(s) used by the application. Based on tracking lifetime of the memory region, non-faulting but improper memory access(es) by the application during its prior execution are detected. Notification of these non-faulting but improper memory access(es) are provided at a user interface and/or to a software component.

Claim (Index 1):
A computer system, comprising:\n one or more processors; and one or more computer-readable media having stored thereon computer-executable instructions that are executable by the one or more processors to detect non-faulting memory accesses during prior execution of an application, based on a replay-able trace of the application's execution, the computer-executable instructions being executable to cause the computer system to perform at least the following:\n replay one or more portions of prior execution of an application from a replay-able trace of execution of the application, while tracking lifetime of a memory region used by the application; \n based on tracking lifetime of the memory region, detect one or more non-faulting memory accesses by the application during its prior execution, including one or more of:\n a memory access by the application beyond a requested size of allocated memory; \n a first read by the application from a first stack location after an ordered sequence of at least: (i) a write to the first stack location while it was valid, (ii) the first stack location being made invalid, and (iii) the first stack location being made valid, and in which the first stack location was not written to between the first stack location being made valid and the first read; \n a second read by the application from a second stack location after an ordered sequence of at least: (i) the second stack location being made valid, (ii) the second stack location being made invalid, and (iii) the second stack location being written to while invalid, and in which the second stack location was not written to while being a valid stack location between the second stack location being written to while invalid and the second read; or \n a first write by the application to a third stack location after an ordered sequence of at least: (i) the third stack location being made valid, and (ii) the third stack location being made invalid, and in which the third stack location is not valid at the time of the first write; and \n \n provide notification of the one or more non-faulting memory accesses.

Metadata:
- Claim Count in Document: 28.0
- Percentile: 86.0
- Lexical Diversity: 2.07407
- Patent Class: 711.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['11449156', '13705316', '13309205', '09714324', '15631872']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.463862872595098
- 35 USC 102 Novelty (BERT): 0.4616441049027882
- Combined Prediction Score: 0.4636409958258671
- Mean Citation Score: 183.651592
- Max Citation Score: 190.76765
- Similarity Product: 171.64480662651658

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

Dataset: test