Analysis of shared data structures for compile-time garbage collection in logic programs
- Louvain Univ., Heverlee (Belgium). Dept. Computerwetenschappen
- Argonne National Lab., IL (USA)
One of the central problems in program analysis for compile-time garbage collection is detecting the sharing of term substructure that can occur during program execution. We present an abstract domain for representing possibly shared structures and an abstract unification operation based on this domain. When supplied to an abstract interpretation framework, this domain induces a powerful analysis of shared structures. We show that the analysis is sound by relating the abstract domain and operation to variants of the concrete domain and operation (substitutions with term unification) that are augmented with information about the term structures shared in actual implementations. We show these instrumented versions of the concrete domain and operation characterize the takes place in standard implementations. 22 refs., 3 figs.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- DOE/ER
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6845717
- Report Number(s):
- CONF-9006169-2; ON: DE90011117
- Resource Relation:
- Conference: 7. international conference on logic programming, Jerusalem (Israel), 18-21 Jun 1990
- Country of Publication:
- United States
- Language:
- English
Similar Records
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)
Complexity issues in parallel logic programming