Prosecution Insights
Last updated: July 17, 2026
Application No. 18/771,764

PROCESSOR WITH HARDWARE-INTEGRATED MEMORY ACCESS PROTECTION

Non-Final OA §103
Filed
Jul 12, 2024
Priority
Jul 13, 2023 — provisional 63/513,447
Examiner
METZGER, MICHAEL J
Art Unit
2183
Tech Center
2100 — Computer Architecture & Software
Assignee
Texas Instruments Incorporated
OA Round
3 (Non-Final)
90%
Grant Probability
Favorable
3-4
OA Rounds
7m
Est. Remaining
98%
With Interview

Examiner Intelligence

Grants 90% — above average
90%
Career Allowance Rate
445 granted / 492 resolved
+35.4% vs TC avg
Moderate +8% lift
Without
With
+7.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
25 currently pending
Career history
521
Total Applications
across all art units

Statute-Specific Performance

§101
4.0%
-36.0% vs TC avg
§103
75.4%
+35.4% vs TC avg
§102
10.2%
-29.8% vs TC avg
§112
3.4%
-36.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 492 resolved cases

Office Action

§103
Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Continued Examination Under 37 CFR 1.114 1. A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on April 2nd, 2026 has been entered. Response to Arguments 2. Applicant’s arguments, filed April 2nd, 2026, with respect to the rejections of claims 1, 3, 6, and 9 under McCarthy and Kinzinger have been fully considered and are persuasive. Therefore, the rejections have been withdrawn. However, upon further consideration, new grounds of rejection are made in view of Sukhomlinov (US 2019/0044971). 3. Applicant’s arguments, filed April 2nd, 2026, with respect to the 35 U.S.C. 103 rejections of claim 10 and its dependents have been fully considered and are persuasive in light of the claim amendments. The claim rejections have been withdrawn. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. 4. Claims 1, 3, 6, and 9 are rejected under 35 U.S.C. 103 as being unpatentable over Sukhomlinov et al (US 2019/0044971, herein Sukhomlinov) in view of Kinzinger (US 2019/0065198). Regarding claim 1, Sukhomlinov teaches a integrated circuit comprising: a memory configured to store instructions ([0021] memory); and a processor device coupled to the memory and configured to execute the instructions ([0021], CPU 116), the processor device configured to: execute a discontinuity instruction that corresponds to a transition from execution according to a first stack to execution according to a second stack, wherein the discontinuity instruction specifies a destination address ([0023], [0029], [0091-0092], switch to a second callee stack in response to executing a call to a callee function); determine whether the destination address stores an entry instruction that corresponds to the discontinuity instruction ([0018], starting address of stack, [0021-0024], function call corresponding to different address space); and based on the destination address storing the entry instruction, begin execution at the destination address (Fig 5, [0018], [0061], start execution at stored address corresponding to a function call). Sukhomlinov fails to teach the execution being according to stack pointers. Kinzinger teaches an integrated circuit configured to identify an entry instruction corresponds to a discontinuity instruction that corresponds to a transition from execution according to a first stack pointer to execution according to a second stack pointer ([0016], call instructions & address operands, [0018-0019], register stack entry addressing). It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the teachings of Sukhomlinov and Kinzinger to utilize explicit stack pointers. While Sukhomlinov does not explicitly disclose that the technique for switching stacks may utilize pointers, a pointer corresponding to a function or other address is a routine and conventional aspect of the microprocessor art. Therefore, utilizing stack pointers would merely entail a simple substitution of known prior art elements to achieve predictable results, and would have been obvious to one of ordinary skill in the art. Regarding claim 3, the combination of Sukhomlinov and Kinzinger teaches the circuit of claim 1, wherein the processor device is configured to generate a fault based on the destination address not storing the entry instruction (Sukhomlinov [0029], generate exception based on call to invalid address space or other privileged locations [0038], [0040], fault condition and exception handling). Regarding claim 6, the combination of Sukhomlinov and Kinzinger teaches the circuit of claim 1, wherein: the processor device is associated with an instruction set; and the entry instruction is distinct from each other combination of instruction and/or data in the instruction set (Kinzinger [0012], instruction set opcode addressing). Regarding claim 9, the combination of Sukhomlinov and Kinzinger teaches the circuit of claim 1, wherein the discontinuity instruction is a call or branch (Sukhomlinov [0022] call instruction). Allowable Subject Matter 5. Claims 10 and 12-23 are allowed. 6. Claims 2, 4-5, and 7-8 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Neiger (US 2022/0283813) discloses a processor that switches to a stack using a branch instruction in response to an inter-privilege-level system call. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL J METZGER whose telephone number is (571)272-3105. The examiner can normally be reached Monday-Friday 8:30-5. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Jyoti Mehta can be reached at 571-270-3995. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /MICHAEL J METZGER/Primary Examiner, Art Unit 2183
Read full office action

Prosecution Timeline

Jul 12, 2024
Application Filed
Jul 01, 2025
Non-Final Rejection mailed — §103
Oct 01, 2025
Response Filed
Dec 02, 2025
Final Rejection mailed — §103
Apr 02, 2026
Request for Continued Examination
Apr 07, 2026
Response after Non-Final Action
Apr 28, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12681726
STREAMING ENGINE WITH CACHE-LIKE STREAM DATA STORAGE AND LIFETIME TRACKING
1y 11m to grant Granted Jul 14, 2026
Patent 12675294
CONCURRENTLY FETCHING INSTRUCTIONS FOR MULTIPLE DECODE CLUSTERS
4y 0m to grant Granted Jul 07, 2026
Patent 12669998
DATA PROCESSING DEVICE
2y 3m to grant Granted Jun 30, 2026
Patent 12664474
GAP COUNTERS FOR SYNCHRONIZATION OF COMPUTE ELEMENTS EXECUTING STATICALLY SCHEDULED INSTRUCTIONS FOR A MACHINE LEARNING ACCELERATOR
3y 3m to grant Granted Jun 23, 2026
Patent 12657130
NEURAL PROCESSING DEVICE AND LOAD/STORE METHOD OF NEURAL PROCESSING DEVICE
2y 7m to grant Granted Jun 16, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
90%
Grant Probability
98%
With Interview (+7.8%)
2y 7m (~7m remaining)
Median Time to Grant
High
PTA Risk
Based on 492 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month