Lazy Set-Sharing Analysis

Abstract

Sharing analysis is widely deployed in the optimisation, specialisation and parallelisation of logic programs. Each abstract unification operation over the classic Jacobs and Langen domain involves the calculation of a closure operation that has exponential worst-case complexity. This paper explores a new tactic for improving performance: laziness. The idea… (More)
DOI: 10.1007/11737414_13

2 Figures and Tables

Topics

  • Presentations referencing similar topics