Efficient Implementation of Set-sharing for Logic Programs

Download or read book Efficient Implementation of Set-sharing for Logic Programs written by Yuanlin Zhu and published by . This book was released on 2012 with total page 194 pages. Available in PDF, EPUB and Kindle. Book excerpt: One of the important set-sharing domains, the JL domain [1], represents substitutions [1] by power sets of variables. The JL domain is inefficient due to the high cost and frequently invoked operator closure-under-union. This thesis presents the work to improve the efficiency of set-sharing analysis using the ideas in [2] and [3], and memoization technique. According to [2], the JL domain is isomorphic to Pos domain [4]. The key idea is to represent the sharing information in Pos domain. In collapsing closure [3], the closures are collapsed and evaluated lazily. In our work, the set-sharing in Pos domain is implemented with efficient ROBDD [5]. The collapsing closure is applied on the frequently invoked model-meet-closure operator, which introduces another operator called model-meet. Both operators have repeating calculations, so we apply the memoization technique on them. The performance is improved significantly with the applications of collapsing closure tactic and memoization technique.