Checking cleanness in linked lists

Nurit Dor, Michael Rodeh, Mooly Sagiv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

27 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationStatic Analysis - 7th International Symposium, SAS 2000, Proceedings
EditorsJens Palsberg
PublisherSpringer Verlag
Pages115-135
Number of pages21
ISBN (Print)3540676686, 9783540676683
DOIs
StatePublished - 2000
Event7th International Symposium on Static Analysis, SAS 2000 - Santa Barbara, CA, United States
Duration: 29 Jun 20001 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1824 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Symposium on Static Analysis, SAS 2000
Country/TerritoryUnited States
CitySanta Barbara, CA
Period29/06/001/07/00

Fingerprint

Dive into the research topics of 'Checking cleanness in linked lists'. Together they form a unique fingerprint.

Cite this