Prosecution Insights
Last updated: April 19, 2026
Application No. 18/917,832

Hybrid Managed and Unmanaged Data Model

Non-Final OA §103§DP
Filed
Oct 16, 2024
Examiner
SHEHNI, GHAZAL B
Art Unit
2499
Tech Center
2400 — Computer Networks
Assignee
Oracle International Corporation
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
2y 8m
To Grant
99%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allow Rate
932 granted / 1068 resolved
+29.3% vs TC avg
Moderate +12% lift
Without
With
+12.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
27 currently pending
Career history
1095
Total Applications
across all art units

Statute-Specific Performance

§101
12.1%
-27.9% vs TC avg
§103
38.5%
-1.5% vs TC avg
§102
20.6%
-19.4% vs TC avg
§112
12.9%
-27.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1068 resolved cases

Office Action

§103 §DP
DETAILED ACTION 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 . Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. Claims 21-40 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-17 of U.S. Patent No. 11663321. Although the claims at issue are not identical, they are not patentably distinct from each other because Claims of patent application contain every element of claims above instant application or vice versa, and as such they anticipate or anticipated by Instant Application. As to Claims 1, 7, 13, of the Pat. *321 anticipates the claims of the instant application. By way of illustration, consider the respective claim 1 from each disclosure: As to Claim 1, Pat. No. *321 discloses: A method comprising: executing, on one or more processors, an application comprising program instructions that implement managed code and unmanaged code; creating, responsive to a request from the managed code, an object accessible by the managed code in a managed state of a plurality of states including the managed state and an unmanaged state, wherein creating the object accessible in the managed state comprises: allocating managed memory for the object from a managed pool; and generating an unmanaged layout template for the object; and transforming, responsive to a requirement by the unmanaged code to access the object, the object to be accessible by the unmanaged code in the unmanaged state (see claims 21, 24 of current application: creating an object accessible in one of a plurality of states including a managed state and an unmanaged state, the object comprising a managed layout template; and transforming the object from the unmanaged state to the managed state responsive to a requirement by managed code to access the object, the transforming comprising: transforming one or more elements of the object into respective managed objects according to the managed layout template; and copying data from unmanaged memory for the object to managed memory for the object according to the managed layout template…claim 24: wherein the object is created accessible in the managed state, the creating further comprising allocating managed memory for the object from a managed pool, and wherein the method further comprises transforming the object from the managed state to the unmanaged state responsive to a requirement by unmanaged code to access the object). Independent claims 21, 28, 35 of the instant application are substantially similar to independent claims 1, 7, 13, of the Pat. *321 and are rejected for substantially similar reasons as discussed supra. Likewise, dependent claims 22-27, 29-34, 36-40 of the instant application are substantially similar to dependent claims 2-6, 8-12, 14-17 (respectively) of the Pat. *321 and are rejected for substantially similar reasons as discussed supra. 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. Claims 21-40 are rejected under 35 U.S.C. 103 as being unpatentable over Satish et al (Pat. No. US 7752242) in view of Kukoleca et al (Pub. No. US 2006/0251095). As per claim 21, Satish discloses a method, comprising: creating an object accessible in one of a plurality of states including a managed state and an unmanaged state, the object comprising a managed layout template (…the transformation module includes a data storage module holding application definitions for use in creating managed assemblies from unmanaged code… see col.4 lines 43-67); and transforming the object from the unmanaged state to the managed state responsive to a requirement by managed code to access the object (…application definitions are established for unmanaged code on the computer system…each application definition includes a manifest, an execution wrapper, and modification data describing how to modify the unmanaged code for the CLR…the transformation module activated in order to transform specific unmanaged code into a managed assembly…see col.6 lines 25-45…the CLR computes the effective permissions set based upon the manifest, the security policy,…and/or other information and creates a domain having the computed permissions…see col.7 lines 3-5), the transforming comprising: transforming one or more elements of the object into respective managed objects according to the managed layout template (…the transformation module modifies the unmanaged code by altering its IAT to call managed APIs instead of unmanaged APIs and/or makes other modifications to the code as specified by the application definition…see col.6 lines 55-65). Satish does not explicitly disclose copying data from unmanaged memory for the object to managed memory for the object according to the managed layout template. However Kukoleca discloses copying data from unmanaged memory for the object to managed memory for the object according to the managed layout template (…the media buffer object provides methods for copying media buffers between managed and unmanaged memory…see par. 20…it copies from the passed buffer of unmanaged memory into the media buffer in managed memory…see Table 3A). Therefore one ordinary skill in the art would have found it obvious before the effective filling date of the claimed invention to use Kukoleca in Satish for including the above limitations because one ordinary skill in the art would recognize it would further improve techniques that would allow for the intercepting of content and providing of content in a uniform manner…see Kukoleca, par. 7. As per claim 28, Satish discloses a system, comprising: one or more processors and a memory storing instructions (see fig.1) that when executed cause the one or more processors to implement an application runtime configured to: create an object accessible in one of a plurality of states including a managed state and an unmanaged state, the object comprising a managed layout template (…the transformation module includes a data storage module holding application definitions for use in creating managed assemblies from unmanaged code… see col.4 lines 43-67); and transform the object from the unmanaged state to the managed state responsive to a requirement by managed code to access the object (…application definitions are established for unmanaged code on the computer system…each application definition includes a manifest, an execution wrapper, and modification data describing how to modify the unmanaged code for the CLR…the transformation module activated in order to transform specific unmanaged code into a managed assembly…see col.6 lines 25-45…the CLR computes the effective permissions set based upon the manifest, the security policy,…and/or other information and creates a domain having the computed permissions…see col.7 lines 3-5), wherein to transform the object the application runtime is configured to: transform one or more elements of the object into respective managed objects according to the managed layout template (…the transformation module modifies the unmanaged code by altering its IAT to call managed APIs instead of unmanaged APIs and/or makes other modifications to the code as specified by the application definition…see col.6 lines 55-65). Satish does not explicitly disclose copy data from unmanaged memory for the object to managed memory for the object according to the managed layout template. However Kukoleca discloses copy data from unmanaged memory for the object to managed memory for the object according to the managed layout template (…the media buffer object provides methods for copying media buffers between managed and unmanaged memory…see par. 20…it copies from the passed buffer of unmanaged memory into the media buffer in managed memory…see Table 3A). Therefore one ordinary skill in the art would have found it obvious before the effective filling date of the claimed invention to use Kukoleca in Satish for including the above limitations because one ordinary skill in the art would recognize it would further improve techniques that would allow for the intercepting of content and providing of content in a uniform manner…see Kukoleca, par. 7. As per claim 35, Satish discloses one or more non-transitory computer-accessible storage media storing program instructions that when executed on or across one or more processors cause the one or more processors to perform: creating an object accessible in one of a plurality of states including a managed state and an unmanaged state, the object comprising a managed layout template (…the transformation module includes a data storage module holding application definitions for use in creating managed assemblies from unmanaged code… see col.4 lines 43-67); and transforming the object from the unmanaged state to the managed state responsive to a requirement by managed code to access the object (…application definitions are established for unmanaged code on the computer system…each application definition includes a manifest, an execution wrapper, and modification data describing how to modify the unmanaged code for the CLR…the transformation module activated in order to transform specific unmanaged code into a managed assembly…see col.6 lines 25-45…the CLR computes the effective permissions set based upon the manifest, the security policy…and/or other information and creates a domain having the computed permissions…see col.7 lines 3-5), the transforming comprising: transforming one or more elements of the object into respective managed objects according to the managed layout template (…the transformation module modifies the unmanaged code by altering its IAT to call managed APIs instead of unmanaged APIs and/or makes other modifications to the code as specified by the application definition…see col.6 lines 55-65). Satish does not explicitly disclose copying data from unmanaged memory for the object to managed memory for the object according to the managed layout template. However Kukoleca discloses copying data from unmanaged memory for the object to managed memory for the object according to the managed layout template (…the media buffer object provides methods for copying media buffers between managed and unmanaged memory…see par. 20…it copies from the passed buffer of unmanaged memory into the media buffer in managed memory…see Table 3A). Therefore one ordinary skill in the art would have found it obvious before the effective filling date of the claimed invention to use Kukoleca in Satish for including the above limitations because one ordinary skill in the art would recognize it would further improve techniques that would allow for the intercepting of content and providing of content in a uniform manner…see Kukoleca, par. 7. As per claims 22, 29, 36, the combination of Satish and Kukoleca discloses wherein subsequent to the transforming, the object is no longer accessible in the unmanaged state (Satish: see col.6 lines 5-8). As per claims 23, 30, 37, the combination of Satish and Kukoleca discloses wherein accesses by the managed code to the object accessible in the managed state are memory-safe (Satish: see col.6 lines 14-17). As per claims 24, 31, 38, the combination of Satish and Kukoleca discloses wherein the object is created accessible in the managed state, the creating further comprising allocating managed memory for the object from a managed pool, and wherein the method further comprises transforming the object from the managed state to the unmanaged state responsive to a requirement by unmanaged code to access the object (Kukoleca: see par. 23). The motivation for claims 24, 31, 38 is the same motivation as in claims 21, 28, 35 above. As per claims 25, 32, 39, the combination of Satish and Kukoleca discloses the transforming further comprising: transforming one or more managed objects of the created object from the managed state to respective elements of the created object the unmanaged state; and releasing the managed memory for the object (Kukoleca: see par. 23). ). The motivation for claims 25, 32, 39 is the same motivation as in claims 21, 28, 35 above As per claims 26, 33, the combination of Satish and Kukoleca discloses wherein the managed code comprises unmanaged program code executed in an emulation environment of a virtual machine (Satish: see col.5 lines 5-8). As per claims 27, 34, 40, the combination of Satish and Kukoleca discloses executing an application comprising program instructions that implement the managed code and unmanaged code, wherein the creating is performed responsive to a request from the managed code (Satish: see col.7 lines 5-14). Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure (see PTO-form 892). The following Patents and Papers are cited to further show the state of the art at the time of Applicant’s invention with respect to executing applications containing both managed code and unmanaged code. Junghans et al (Pub. No. US 2010/0030845); “Enforcement of Object Permissions in Enterprise Resource Planning Software”; -Teaches middle-tier server includes several components used in managing and enforcing object permissions…the middle-tier server includes both an unmanaged portion and a managed portion…the unmanaged portion includes code library and user permissions table…the managed portion includes code library, execute permissions table, and objects…managed code library provides logic for interacting with enhanced client and for checking user and object permissions…objects are compiled versions of the objects for which source code is stored in object metadata table…objects are retrieved from object table in response to a user request to instantiate an object…see par. 16-17 Dragoljevic et al (Pub. No. US 2017/0139824); “Memory Management and Image Display for Mobile Devices”; -Teaches the memory manager can be configured to handle requests to store, modify, or access objects in memory…the memory manager can communicate with other specialized components, such as the handler or the image purger, to handle requests…see par. 42. Any inquiry concerning this communication or earlier communications from the examiner should be directed to GHAZAL B SHEHNI whose telephone number is (571)270-7479. The examiner can normally be reached Mon-Fri 9am-5pm PCT. 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, Philip Chea can be reached at 5712723951. 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. /GHAZAL B SHEHNI/Primary Examiner, Art Unit 2499
Read full office action

Prosecution Timeline

Oct 16, 2024
Application Filed
Mar 19, 2026
Non-Final Rejection — §103, §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602479
MEASURING CONTAINERS
2y 5m to grant Granted Apr 14, 2026
Patent 12596810
AUTOMATED APPLICATION PROGRAMMING INTERFACE (API) TESTING
2y 5m to grant Granted Apr 07, 2026
Patent 12591682
AUTOMOTIVE SECURE BOOT WITH SHUTDOWN MEASURE
2y 5m to grant Granted Mar 31, 2026
Patent 12591660
DEVICE SECURITY MANAGER ARCHITECTURE FOR TRUSTED EXECUTION ENVIRONMENT INPUT/OUTPUT (TEE-IO) CAPABLE SYSTEM-ON-A-CHIP INTEGRATED DEVICES
2y 5m to grant Granted Mar 31, 2026
Patent 12585741
PASSWORD PROMPT FOR SECURE CAMERA ACTIVATION
2y 5m to grant Granted Mar 24, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
87%
Grant Probability
99%
With Interview (+12.4%)
2y 8m
Median Time to Grant
Low
PTA Risk
Based on 1068 resolved cases by this examiner. Grant probability derived from career allow 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