A new algorithm is presented that automatically uncovers memory errors such as NULL pointers dereference and memory leaks in C programs. The algorithm is conservative, i.e., it can never miss an error but may report "false alarms". When applied to several intricate C programs manipulating singly linked lists, the new algorithm yields more accurate results, does not report any false alarm and usually runs even faster and consumes less space than a less precise algorithm. © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Dor, N., Rodeh, M., & Sagiv, M. (2000). Checking cleanness in linked lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1824 LNCS, pp. 115–135). Springer Verlag. https://doi.org/10.1007/978-3-540-45099-3_7
Mendeley helps you to discover research relevant for your work.