Method to detect unbounded growth of linked lists in a...

Details Method to detect unbounded growth of linked lists in a... Method to detect unbounded growth of linked lists in a...

2005-05-10

2005-05-10

Nguyen-Ba, Antony (Department: 2122)

Data processing: software development, installation, and managem

Software program development tool

Testing or debugging

C717S162000

Reexamination Certificate

active

06892378

ABSTRACT:
A method for detecting memory leakage of a linked list in a running program, includes saving current size of the linked list as a new maximum size of the linked list when a new element is added to the linked list that causes the current size of the linked list to exceed a former maximum size of the linked list, determining whether a first pre-determined period of time has elapsed from when the liked list was created, and determining whether the new maximum size of the linked list exceeds the former maximum size of the linked list during a second pre-determined period of time.

REFERENCES:
patent: 5784699 (1998-07-01), McMahon et al.
patent: 6206584 (2001-03-01), Hastings
patent: 6269477 (2001-07-01), Fitzgerald et al.
patent: 20020120640 (2002-08-01), Hills
Great Britain Search Report issued in connection with foreign counterpart GB application No. 0220476.6, dated May 2, 2003.

Affiliated with

Also associated with

Rating

Method to detect unbounded growth of linked lists in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method to detect unbounded growth of linked lists in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method to detect unbounded growth of linked lists in a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3458590