BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation (Lecture Notes in Computer Science, 675)

Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation (Lecture Notes in Computer Science, 675)

Live Data Structures in Logic Programs: Derivation by Means of Abstract
Stock photo: cover may vary

Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation (Lecture Notes in Computer Science, 675) Paperback - 1993 - 1993rd Edition

by Mulkers, Anne

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$128.82
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation (Lecture Notes in Computer Science, 675)

From the publisher

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.
tracking-