Patents by Inventor Satish Chandra Gupta
Satish Chandra Gupta 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).
-
Publication number: 20240078156Abstract: Techniques for UNDO and REDO operations in a computer-user interface are disclosed. The techniques enables users to configure entities for UNDO and REDO operations. The techniques also enable users to roll back individual entity to an immediate previous state in one UNDO operation and subsequently to the other previous states. Other entities are not affected by the UNDO operations to the entity.Type: ApplicationFiled: September 6, 2022Publication date: March 7, 2024Applicant: Oracle International CorporationInventors: Satish Chandra Oruganti, Ganesh Kumar Gupta, Michael Patrick Rodgers
-
Patent number: 8959490Abstract: Embodiments of the present invention provide a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data is large for a complex and long running program, data is processed to present it to a user in useful ways so that a programmer improves the heap utilization in the program.Type: GrantFiled: May 2, 2012Date of Patent: February 17, 2015Assignee: International Business Machines CorporationInventors: Satish Chandra Gupta, Kumar Rangarajan
-
Patent number: 8549503Abstract: Dangling pointers and memory leak locations within software are detected. As the software allocates and deallocates memory, lists of pointers referencing the memory, and pointer status, are maintained. As the software writes new addresses within pointers and reads addresses referenced by the pointers, the pointer lists are maintained to determine whether the pointers are dangling and to detect memory leak locations. A balanced binary tree having a number of nodes can be maintained. The nodes represent heap or stack records. Each heap record corresponds to heap memory that has been allocated and has a list of pointers referencing the heap memory. Each stack record corresponds to a stack within which a stack frame is allocated each time a function is entered. The stack record has frame records corresponding to the stack frames. Each frame record has a list of pointers referencing the corresponding stack frame.Type: GrantFiled: April 17, 2012Date of Patent: October 1, 2013Assignee: International Business Machines CorporationInventor: Satish Chandra Gupta
-
Publication number: 20120278585Abstract: This disclosure provides a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program, and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data could be relatively large for a complex and long running program, data is processed to present it to a user in useful ways so that the programmer can improve the heap utilization in the program.Type: ApplicationFiled: May 2, 2012Publication date: November 1, 2012Applicant: International Business Machines CorporationInventors: Satish Chandra Gupta, Kumar Rangarajan
-
Patent number: 8245209Abstract: Dangling pointers and memory leak locations within software are detected. As the software allocates and deallocates memory, lists of pointers referencing the memory, and pointer status, are maintained. As the software writes new addresses within pointers and reads addresses referenced by the pointers, the pointer lists are maintained to determine whether the pointers are dangling and to detect memory leak locations. A balanced binary tree having a number of nodes can be maintained. The nodes represent heap or stack records. Each heap record corresponds to heap memory that has been allocated and has a list of pointers referencing the heap memory. Each stack record corresponds to a stack within which a stack frame is allocated each time a function is entered. The stack record has frame records corresponding to the stack frames. Each frame record has a list of pointers referencing the corresponding stack frame.Type: GrantFiled: May 29, 2007Date of Patent: August 14, 2012Assignee: International Business Machines CorporationInventor: Satish Chandra Gupta
-
Publication number: 20120204165Abstract: Dangling pointers and memory leak locations within software are detected. As the software allocates and deallocates memory, lists of pointers referencing the memory, and pointer status, are maintained. As the software writes new addresses within pointers and reads addresses referenced by the pointers, the pointer lists are maintained to determine whether the pointers are dangling and to detect memory leak locations. A balanced binary tree having a number of nodes can be maintained. The nodes represent heap or stack records. Each heap record corresponds to heap memory that has been allocated and has a list of pointers referencing the heap memory. Each stack record corresponds to a stack within which a stack frame is allocated each time a function is entered. The stack record has frame records corresponding to the stack frames. Each frame record has a list of pointers referencing the corresponding stack frame.Type: ApplicationFiled: April 17, 2012Publication date: August 9, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Satish Chandra Gupta
-
Patent number: 8185880Abstract: This disclosure provides a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program, and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data could be relatively large for a complex and long running program, data is processed to present it to a user in useful ways so that the programmer can improve the heap utilization in the program.Type: GrantFiled: October 4, 2007Date of Patent: May 22, 2012Assignee: International Business Machines CorporationInventors: Satish Chandra Gupta, Kumar Rangarajan
-
Patent number: 7990980Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.Type: GrantFiled: December 27, 2007Date of Patent: August 2, 2011Assignee: International Business Machines CorporationInventors: Ziv Glazberg, Janees Elamkulam, Satish Chandra Gupta, Sandeep Kohli, Ishai Rabinovitz
-
Patent number: 7861231Abstract: A method and system to identifying the use of dangling pointers in software instrumentation irrespective of the location of the pointer in the memory. The main memory is preferably segmented into three parts defined as a first memory, a version segment and a pointer version segment. By use of the version segment and pointer version stored in the pointer version segment, checksum are made on a pointer version with a version on dereferencing a pointer in the first memory to identify references to a dangling pointer on negative determination. Identified dangling pointer may be reported to the end user.Type: GrantFiled: March 9, 2007Date of Patent: December 28, 2010Assignee: International Business Machines CorporationInventors: Kumar Rangarajan, Satish Chandra Gupta, Ziv Glazberg, Ishai Rabinovitz
-
Publication number: 20090168785Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.Type: ApplicationFiled: December 27, 2007Publication date: July 2, 2009Inventors: Ziv Glazberg, Janees Elamkulam, Satish Chandra Gupta, Sandeep Kohli, Ishai Rabinovitz
-
Publication number: 20090094589Abstract: This disclosure provides a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program, and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data could be relatively large for a complex and long running program, data is processed to present it to a user in useful ways so that the programmer can improve the heap utilization in the program.Type: ApplicationFiled: October 4, 2007Publication date: April 9, 2009Inventors: SATISH CHANDRA GUPTA, Kumar Rangarajan
-
Publication number: 20080301646Abstract: Dangling pointers and memory leak locations within software are detected. As the software allocates and deallocates memory, lists of pointers referencing the memory, and pointer status, are maintained. As the software writes new addresses within pointers and reads addresses referenced by the pointers, the pointer lists are maintained to determine whether the pointers are dangling and to detect memory leak locations. A balanced binary tree having a number of nodes can be maintained. The nodes represent heap or stack records. Each heap record corresponds to heap memory that has been allocated and has a list of pointers referencing the heap memory. Each stack record corresponds to a stack within which a stack frame is allocated each time a function is entered. The stack record has frame records corresponding to the stack frames. Each frame record has a list of pointers referencing the corresponding stack frame.Type: ApplicationFiled: May 29, 2007Publication date: December 4, 2008Inventor: Satish Chandra Gupta
-
Publication number: 20080222224Abstract: A method and system to identifying the use of dangling pointers in software instrumentation irrespective of the location of the pointer in the memory. The main memory is preferably segmented into three parts defined as a first memory, a version segment and a pointer version segment. By use of the version segment and pointer version stored in the pointer version segment, checksum are made on a pointer version with a version on dereferencing a pointer in the first memory to identify references to a dangling pointer on negative determination. Identified dangling pointer may be reported to the end user.Type: ApplicationFiled: March 9, 2007Publication date: September 11, 2008Inventors: Kumar Rangarajan, Satish Chandra Gupta, Ziv Glazberg, Ishai Rabinovitz