Cantitate/Preț
Produs

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

Autor Anne Mulkers
en Limba Engleză Paperback – 27 mai 1993
A common hazard for implementations of applicativeprogramming languages is the excessive creation of garbagecells during program execution. The available run-timegarbage collecting processes are expensive in time and oftenrequire a periodic disruption of the program execution. Thepresent book addresses the problem of memory re-use forlogic programs through program analysis rather than byrun-time garbage collection. The static analysis isconstructed as an application of abstractinterpretation forlogic programs. The starting point is a previously developedapplication of integrated type and mode analysis, whichbasically supplies a description of the logical terms towhich program variables can be bound at run time. Thecontribution of the book consists of a modular extension ofthe abstract domain and operations in order to deriverun-time properties concerning the sharing and liveness ofterm substructures dynamically created during programexecution. Alsoillustrated is how such information can beused by the compiler to improve the allocation of run-timestructures and to automatically introduce destructiveassignments in logic languages in a safe and transparentway, thereby shifting some part of the run-time storagereclamation overhead to compile time.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31655 lei

Preț vechi: 39569 lei
-20%

Puncte Express: 475

Preț estimativ în valută:
6065 6569$ 5201£

Carte tipărită la comandă

Livrare economică 06-13 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540566946
ISBN-10: 3540566945
Pagini: 236
Ilustrații: IX, 227 p.
Dimensiuni: 155 x 233 x 12 mm
Greutate: 0.76 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Descriere

A common hazard for implementations of applicativeprogramming languages is the excessive creation of garbagecells during program execution. The available run-timegarbage collecting processes are expensive in time and oftenrequire a periodic disruption of the program execution. Thepresent book addresses the problem of memory re-use forlogic programs through program analysis rather than byrun-time garbage collection. The static analysis isconstructed as an application of abstractinterpretation forlogic programs. The starting point is a previously developedapplication of integrated type and mode analysis, whichbasically supplies a description of the logical terms towhich program variables can be bound at run time. Thecontribution of the book consists of a modular extension ofthe abstract domain and operations in order to deriverun-time properties concerning the sharing and liveness ofterm substructures dynamically created during programexecution. Alsoillustrated is how such information can beused by the compiler to improve the allocation of run-timestructures and to automatically introduce destructiveassignments in logic languages in a safe and transparentway, thereby shifting some part of the run-time storagereclamation overhead to compile time.

Cuprins

Abstract interpretation.- Related work.- Sharing analysis.- Liveness analysis.- Conclusion.