Skip to main content
SpringerLink
Log in
Book cover

Live Data Structures in Logic Programs

Derivation by Means of Abstract Interpretation

  • Book
  • © 1993

Overview

Authors:
  1. Anne Mulkers
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 675)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-4

  3. Abstract interpretation

    Pages 5-29

  4. Related work

    Pages 31-45

  5. Sharing analysis

    Pages 47-125

  6. Liveness analysis

    Pages 127-178

  7. Conclusion

    Pages 179-181

  8. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

A common hazard for implementations of applicative programming languages is the excessive creation of garbage cells during program execution. The available run-time garbage collecting processes are expensive in time and often require a periodic disruption of the program execution. The present book addresses the problem of memory re-use for logic programs through program analysis rather than by run-time garbage collection. The static analysis is constructed as an application of abstractinterpretation for logic programs. The starting point is a previously developed application of integrated type and mode analysis, which basically supplies a description of the logical terms to which program variables can be bound at run time. The contribution of the book consists of a modular extension of the abstract domain and operations in order to derive run-time properties concerning the sharing and liveness of term substructures dynamically created during program execution. Alsoillustrated is how such information can be used by the compiler to improve the allocation of run-time structures and to automatically introduce destructive assignments in logic languages in a safe and transparent way, thereby shifting some part of the run-time storage reclamation overhead to compile time.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation