Method to detect unbounded growth of linked lists in a running application
US6892378B2 · kind B2 · utility
11Cited by
4References
14Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 17, 2001 |
| Grant date | May 10, 2005 |
| Priority date | — |
| Expiry date | Apr 4, 2023 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/0253
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.