Patents by Inventor Mahesh Prakriya
Mahesh Prakriya has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7610322Abstract: Enabling secure and efficient marshaling, utilization, and releasing of handles in either of an operating system or runtime environment includes wrapping a handle with a counter to tabulate a number of threads using currently using the handle. Thus, handle administration is implemented to circumvent potential security risks, avoid correctness problems, and foster more efficient handle releasing.Type: GrantFiled: May 25, 2004Date of Patent: October 27, 2009Assignee: Microsoft CorporationInventors: Brian M. Grunkemeyer, David Sebastien Mortenson, Rudi Martin, Sonja Keserovic, Mahesh Prakriya, Christopher W. Brumme
-
Patent number: 7610579Abstract: A finalizer may include a notification that no tolerance for failure or corruption is expected. Any potential failure point, which may be induced by a runtime execution environment routine or subroutine that is associated with the finalizer may then be prepared apart from the finalizer.Type: GrantFiled: December 10, 2004Date of Patent: October 27, 2009Assignee: Microsoft CorporationInventors: Sean E. Trowbridge, Brian M. Grunkemeyer, Christopher W. Brumme, Mahesh Prakriya, Patrick H. Dussud, Ian H. Carmichael
-
Patent number: 7571428Abstract: Reliability contracts declare an intent of executable code, and may be associated with at least a portion of the executable code. The intent of the executable code in the face of particular conditions may be declared for the use in any one of a programming, execution, or testing environment.Type: GrantFiled: May 14, 2004Date of Patent: August 4, 2009Assignee: Microsoft CorporationInventors: Rudi Martin, Mahesh Prakriya, Brian M. Grunkemeyer, Christopher W. Brumme, Sean E. Trowbridge, Weiwen Liu
-
Patent number: 7487380Abstract: Deterministic code execution may be recovered for programs or portions thereof by implementing a programmable policy on a system host to escalate the scope of a code discard based on various parameters.Type: GrantFiled: October 14, 2004Date of Patent: February 3, 2009Assignee: Microsoft CorporationInventors: Christopher W Brumme, WeiWen Liu, Mahesh Prakriya, Sean E Trowbridge, Ian H Carmichael, Patrick H Dussud, Brian M Grunkemeyer
-
Patent number: 7418718Abstract: Systems and methods for enhanced runtime hosting are described. In one aspect the runtime hosting interface includes a host abstraction interface. The HAI allowing the runtime to configure host execution environment parameters and/or notify the host of a runtime event. In particular, the host abstraction interface (HAI) corresponds to execution environment abstractions supported by a host application. Responsive to an action or event, the runtime invokes an identified HAI or an associated object during execution of runtime managed code.Type: GrantFiled: February 3, 2004Date of Patent: August 26, 2008Assignee: Microsoft CorporationInventors: Weiwen Liu, Steven J. Pratschner, Ian H. Carmichael, Peter A. Carlin, Christopher W. Brumme, Mason K. Bendixen, Beysim Sezgin, Sean E. Trowbridge, Christopher James Brown, Mei-Chin Tsai, Mahesh Prakriya, Raja Krishnaswamy, Alan C. Shi, Suzanne Maurine Cook
-
Publication number: 20060230387Abstract: Dynamic memory management configuration enables certain behavior of an application to be controlled without touching or affecting any executable portion of the application.Type: ApplicationFiled: April 6, 2005Publication date: October 12, 2006Applicant: Microsoft CorporationInventors: Mahesh Prakriya, Robin Maffeo, Patrick Dussud
-
Publication number: 20060156152Abstract: A finalizer may include a notification that no tolerance for failure or corruption is expected. Any potential failure point, which may be induced by a runtime execution environment routine or subroutine that is associated with the finalizer may then be prepared apart from the finalizer.Type: ApplicationFiled: December 10, 2004Publication date: July 13, 2006Applicant: Microsoft CorporationInventors: Sean Trowbridge, Brian Grunkemeyer, Christopher Brumme, Mahesh Prakriya, Patrick Dussud, Ian Carmichael
-
Publication number: 20060101401Abstract: Deterministic code execution may be recovered for programs or portions thereof by implementing a programmable policy on a system host to escalate the scope of a code discard based on various parameters.Type: ApplicationFiled: October 14, 2004Publication date: May 11, 2006Applicant: Microsoft CorporationInventors: Christopher Brumme, WeiWen Liu, Mahesh Prakriya, Sean Trowbridge, Ian Carmichael, Patrick Dussud, Brian Grunkemeyer
-
Publication number: 20060070041Abstract: Authored code may include a notification that no tolerance for failure or corruption is expected for an identified sub-set of the code. Any potential failure point, which may be induced by a runtime environment routine or sub-routine, that is associated with the identified sub-set of code may then be identified and hoisted to a point apart from the identified sub-set of code.Type: ApplicationFiled: September 29, 2004Publication date: March 30, 2006Applicant: Microsoft CorporationInventors: Christopher Brumme, Sean Trowbridge, Rudi Martin, WeiWen Liu, Brian Grunkemeyer, Mahesh Prakriya
-
Publication number: 20060004805Abstract: Enabling secure and efficient marshaling, utilization, and releasing of handles in either of an operating system or runtime environment includes wrapping a handle with a counter to tabulate a number of threads using currently using the handle. Thus, handle administration is implemented to circumvent potential security risks, avoid correctness problems, and foster more efficient handle releasing.Type: ApplicationFiled: May 25, 2004Publication date: January 5, 2006Applicant: Microsoft CorporationInventors: Brian Grunkemeyer, David Mortenson, Rudi Martin, Sonja Keserovic, Mahesh Prakriya, Christopher Brumme
-
Publication number: 20050273764Abstract: Reliability contracts declare an intent of executable code, and may be associated with at least a portion of the executable code. The intent of the executable code in the face of particular conditions may be declared for the use in any one of a programming, execution, or testing environment.Type: ApplicationFiled: May 14, 2004Publication date: December 8, 2005Applicant: Microsoft CorporationInventors: Rudi Martin, Mahesh Prakriya, Brian Grunkemeyer, Christopher Brumme, Sean Trowbridge, Weiwen Liu
-
Publication number: 20050172133Abstract: A host intercepts calls between two executables and determines whether the calls are permissible according to the host's security model which can be identify based, such as user identity based—for instance, mapping access rights within a specific data base user context to database object access. Such an identity security model differs from a common language runtime security model where managed code uses Code Access Security to prevent managed assemblies from performing certain operations. Managed assemblies registered with the host are host objects from the host's perspective for which access rights can be defined via security rules, such as are defined for individual user identities. A host can decide access between managed executables based on the host's identity based access rules by trapping any cross assembly calls and deciding whether such calls should proceed or be blocked from taking place based on the corresponding identity security settings.Type: ApplicationFiled: February 3, 2004Publication date: August 4, 2005Inventors: Christopher Brumme, Vance Morrison, Sebastian Lange, Gregory Fee, Dario Russi, Simon Hall, Mahesh Prakriya, Brian Sullivan
-
Publication number: 20050172286Abstract: A host operating in a managed environment intercepts a call from a managed caller to a particular callee and determines whether the call is permissible according to the host's prior configuration of a plurality of callees. The particular callee, which provides access to a resource that the host can be protecting, can have been previously configured by the host to always allow the call to be made, to never allow the call to be made, or to allow the call to be made based upon the degree to which the host trusts the managed caller.Type: ApplicationFiled: February 3, 2004Publication date: August 4, 2005Inventors: Christopher Brumme, Sebastian Lange, Gregory Fee, Michael Gashler, Mahesh Prakriya
-
Publication number: 20040237064Abstract: Systems and methods for enhanced runtime hosting are described. In one aspect the runtime hosting interface includes a host abstraction interface. The HAI allowing the runtime to configure host execution environment parameters and/or notify the host of a runtime event. In particular, the host abstraction interface (HAI) corresponds to execution environment abstractions supported by a host application. Responsive to an action or event, the runtime invokes an identified HAI or an associated object during execution of runtime managed code.Type: ApplicationFiled: February 3, 2004Publication date: November 25, 2004Applicant: Microsoft CorporationInventors: Weiwen Liu, Steven J. Pratschner, Ian H. Carmichael, Peter A. Carlin, Christopher W. Brumme, Mason K. Bendixen, Beysim Sezgin, Sean E. Trowbridge, Christopher James Brown, Mei-Chin Tsai, Mahesh Prakriya, Raja Krishnaswamy, Alan C. Shi, Suzanne Maurine Cook
-
Patent number: 6801200Abstract: A rectilinear layout system creates a diagram (graph) from information about items (nodes) and relationships among the items, such as the information which defines data bases, computer networks, and object based systems. The rectilinear layout system designates one of the items as a focus node and partitions the remaining items into clusters (sub-graphs) of related nodes. Multiple location groups are created that are relative to the focus node for the graph and each sub-graph is assigned to a location group. The rectilinear layout system then plots a location for each node in each of the sub-graphs by recursively iterating through the sub-graphs, designating focus nodes for each sub-graph, creating lower level sub-graphs, and assigning the lower level sub-graphs to location groups relative to the corresponding focus node until a lower level sub-graph contains only a single node.Type: GrantFiled: November 21, 2000Date of Patent: October 5, 2004Assignee: Microsoft CorporationInventors: Mahesh Prakriya, Xiaoning Ling, Shoshanna K. Budzianowski
-
Patent number: 6154220Abstract: A rectilinear layout system creates a diagram (graph) from information about items (nodes) and relationships among the items, such as the information which defines data bases, computer networks, and object based systems. The rectilinear layout system designates one of the items as a focus node and partitions the remaining items into clusters (sub-graphs) of related nodes. Multiple location groups are created that are relative to the focus node for the graph and each sub-graph is assigned to a location group. The rectilinear layout system then plots a location for each node in each of the sub-graphs by recursively iterating through the sub-graphs, designating focus nodes for each sub-graph, creating lower level sub-graphs, and assigning the lower level sub-graphs to location groups relative to the corresponding focus node until a lower level sub-graph contains only a single node.Type: GrantFiled: October 19, 1998Date of Patent: November 28, 2000Assignee: Microsoft CorporationInventors: Mahesh Prakriya, Xiaoing Ling, Shoshanna K. Budzianowski