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

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

In Stock
SKU: DADAX3540566945
Brand: Springer
Condition: New
Regular price$70.87
Quantity
Add to wishlist
Add to compare
Sold by Ergodebooks, an authorized reseller.

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

A common hazard for implementations of applicative programming languages is the excessive creation of garbage cells during program execution. The available runtime 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 reuse for logic programs through program analysis rather than by runtime 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 runtime 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 runtime structures and to automatically introduce destructive assignments in logic languages in a safe and transparent way, thereby shifting some part of the runtime storage reclamation overhead to compile time.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed