Dynamic memory heap tagging

Details Dynamic memory heap tagging Dynamic memory heap tagging

2008-03-25

2008-03-25

Bataille, Pierre-Michel (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Memory configuring

C707S793000, C711S167000, C711S172000

Reexamination Certificate

active

07350045

ABSTRACT:
A data structure within a block of allocable memory of a memory structure such as a heap is used to identify the function that is responsible for causing memory problems such as random overwrites, buffer overruns, double or multiple “frees,” and the like. The data structure can use the return address of the function that allocates or frees the allocable memory block to identify the caller. An identifier for the function is generated and stored in the allocable memory block.

REFERENCES:
patent: 6381682 (2002-04-01), Noel et al.
patent: 6658652 (2003-12-01), Alexander et al.
patent: 6985976 (2006-01-01), Zandonadi et al.
patent: 7124251 (2006-10-01), Clark et al.
patent: 7133993 (2006-11-01), Jackson et al.
patent: 7158991 (2007-01-01), Kekre et al.
patent: 2004/0221120 (2004-11-01), Abrashkevich et al.
Data Structure and Insertion Algorithm for Representing Asynchronous Occurrences for Visualization by Trace Visualization Tools using Ghant Charts with Occurrence Hierarchies; International Business Machines Technical Disclosure Bulletin; vol. 36, No. 07, Jul. 1993; pp. 547-557.
Petit-Bianco, Alexandre, “Java Garbage Collection for Real-Time Systems”, Dr. Dobb's Journal Oct. 1998. www.ddj.com/documents/s=915/ddj9810a/9810a.
Interrupt Driven Task Scheduler for Systems, IBM Technical Disclosure Bulletin, Mar. 1992.
Olivier Danvy;Memory Allocation and Higher-Order Functions; 1987; pp. 241-252.
Steve Churchill;Exception Recovery with Smart Pointers; C++ Report Jan. 1994; pp. 34-42.
Witawas Srisa-an, Chia-Tien Dan Lo, and J. Morrie Chang;Scalable Hardware-algorithm for Mark-sweep Garbage Collection; 2000 IEEE; pp. 274-281.
Jonathan D. Bright, Gregory F. Sullivan and Gerald M. Masson;Checking the Integrity of Trees; 1995 IEEE; pp. 402-411.
Hamed Seyed-allaei;Finite-size Scaling Approach to Dynamic Storage Allocation Problem; Science Direct Apr. 2003; pp. 563-569.
Kelvin Nilsen;Reliable Real-Time Garbage Collection of C++; 1994 the USENIX Association, Computing Systems, vol. 7, No. 4, Fall 1994; pp. 467-504.
Steve Oualline;Heap Checking—A pair of libraries for handling heap-related bugs; Dr. Dobb's Journal, Nov. 1993; pp. 28-32.
Lawrence D. Spencer;Debugging Memory Allocation Errors—Replacing standard C functions and checking the status of heap; Dr. Dobb's Journal, Aug. 1990; pp. 716-719, 782-784.
Tom Schotland and Peter Petersen;Exception Handling in C Without C++—Clean error handling without overhead; Dr. . Dobb's Journal, Nov. 2000; pp. 102-110.
Tom Loveless;Code-Spionage füreinen guten Zweck; ElektronikMar. 2000: pp. 140-145.

Affiliated with

Also associated with

Rating

Dynamic memory heap tagging does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic memory heap tagging, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic memory heap tagging will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2795710