Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

A note on Cheney's nonrecursive list-compacting algorithm

Published: 01 April 1972 Publication History
  • Get Citation Alerts
  • Abstract

    Cheney's list-compacting algorithm [1] goes into an infinite loop when it traces a circular list consisting exclusively of non-items. While it may be reasonable to say that such lists should not exist, it would be very difficult to legislate out of existence programs which illegally create such lists because of bugs, and it would not do for the garbage collector to break down in this instance.

    Reference

    [1]
    Cheney, C. J. A nonrecursive list-compacting algorithm. Comm. ACM 13, 11 (Nov. 1970), 677-678.

    Cited By

    View all
    • (1994)A bibliography on garbage collection and related topicsACM SIGPLAN Notices10.1145/185009.18504029:9(149-158)Online publication date: Sep-1994
    • (1981)Garbage Collection of Linked Data StructuresACM Computing Surveys (CSUR)10.1145/356850.35685413:3(341-367)Online publication date: Sep-1981

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Communications of the ACM
    Communications of the ACM  Volume 15, Issue 4
    April 1972
    70 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/361284
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 April 1972
    Published in CACM Volume 15, Issue 4

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. garbage collection
    2. list compacting

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)41
    • Downloads (Last 6 weeks)9
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (1994)A bibliography on garbage collection and related topicsACM SIGPLAN Notices10.1145/185009.18504029:9(149-158)Online publication date: Sep-1994
    • (1981)Garbage Collection of Linked Data StructuresACM Computing Surveys (CSUR)10.1145/356850.35685413:3(341-367)Online publication date: Sep-1981

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Full Access

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media