Mulkers, A., Winsborough, W. H., and Bruynooghe, M. 1994. Live-Structure Dataflow Analysis for Prolog. ACM Transactions on Programming Languages and Systems 16, 2, 205--258.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....could be represented more accurately, by requiring the domain to keep track of the di#erent chains contained in the structures to which the program variables are bound, their individual trailing state and how these are a#ected by the di#erent program constructs. Known techniques (see for instance [7, 6, 9]) based on type information could be used to keep track of the constructor that a variable is bound to and the trailing state of the di#erent arguments, thereby making this approach possible. This applies equally to the analysis of the classical scheme. Additionally it would be interesting to see ....

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for prolog. ACM TOPLAS, 16:205--258!, 1994.

....bound variables more accurately, by requiring the domain to keep track of the di#erent chains contained in the structures to which the program variables are bound, their individual trailing state and how these are a#ected by the di#erent program constructs. Known techniques (see for instance [JB93,HCC95,MWB94]) based on type information could be used to keep track of the constructor that a variable is bound to and of the trailing state of the di#erent arguments, thereby making this approach possible. 5 Analysing HAL Body Constructs This section defines the notrail operations required by HAL s ....

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for prolog. ACM TOPLAS, 16:205--258, 1994.

....very sophisticated schemes for collecting garbage efficiently now exist, the process is still potentially time consuming and hard to predict. It would be desirable to move some of the workload to the compiler. Several proposals for doing compile time garbage collection have been made; see e.g. [8, 7] and the references therein. Region based memory management [10] takes this principle to the limit. Here all deallocation points in the program are determined by a compile time analysis, and the runtime system needs only to carry out the preselected actions. Though not all programs are ....

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for Prolog. ACM Trans. Prog. Lang. Syst., 16(2):205--258, Mar. 1994.

....problems. On the theoretical side, for example, liveness analysis using the Prop domain, or any domain of comparable precision, is EXPTIME complete [8] on the practical side, the system described by Mulkers et al. requires over 8 seconds to analyze the four clause naive reverse program [19]. The second reason is that in practice, global data flow analyses especially the complex alias analyses required for structure reuse often turn out to be very fragile : small and apparently minor changes to a program text can have profound effects on analysis results and the performance of ....

....transformation scheme is easily extended to handle this. 6 Previous Work A number of authors have considered the optimization of programs in single assignment languages to incorporate destructive updates, e.g. see [4, 14, 13, 15, 16, 17] in the context of functional programming languages, and [6, 5, 10, 18, 19, 23] in the context of logic programming languages. The work of Bruynooghe [6, 5] Foster and Winsborough [10] Hudak and Bloss [4, 15, 16] Mulkers et al. 19] and Sastry et al. 23] focus on compile time reference counting schemes to determine when a data structure being updated has at most one ....

[Article contains additional citation context not shown here]

Anne Mulkers, William Winsborough and Maurice Bruynooghe. Live-Structure Dataflow Analysis for Prolog. ACM Transactions on Programming Languages and Systems vol. 16 no. 2, March 1994, pp. 205-- 258.

....it s inability to retain information at the end of a data structure. Note however that even if we use other abstractions and their corresponding abstract operation proposed in the literature, such as type graphs [11] regular types [8] or refined types for compile time garbage collection of [25], the information still gets lost. The heart of the problem is that in all these methods the abstract operator is applied to atoms of each predicate symbol separately. In this program (and many, much more relevant others, as we will discuss later in the paper) we are interested in analysing the ....

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure data-flow analysis for prolog. ACM Transactions on Programming Languages and Systems, 16(2):205--258, 1994.

....Lloyd [1987] The fixpoint of the operator a set of complete SLD sequences represents the operational semantics as it describes in sufficient detail the behavior of the program for the analyses considered in this article. If desired, sequences could be instrumented with more detail (e.g. Mulkers et al. 1994]) 2.3 Abstract Interpretation The most familiar framework for abstract interpretation is defined in terms of Galois connections and Galois insertions [Cousot and Cousot 1977; 1992a] Definition 2.3.1 (Galois Connection) A Galois connection is a quadruple (Dom C , ff, Dom A , fl) where: ....

....P. Van Hentenryck (bridge, cutstock , warehouse) from Van Hentenryck [1989, magic (p. 155) perm (p. 152) and Van Hentenryck and Ramachandran [1994, periodic (p. 350) from PrologIA (color4, color4F , triangle) and from Colmerauer [1990] magicC ) Most of the LP benchmarks are used in Mulkers et al. 1994], from which we borrow the following brief description of the programs. akl (called init vars in Mulkers et al. 1994] initializes two abstract substitutions to have the same set of variables; akl old is a slightly modified version of akl ; ann is a simplified version of Prolog s parallelizing ....

[Article contains additional citation context not shown here]

Mulkers, A., Winsborough, W., and Bruynooghe, M. 1994. Live-structure dataflow analysis for Prolog. ACM Trans. Program. Lang. Syst. 16, 2 (Mar.), 205--258.

....memory. This paper develops a backward use analysis and makes several proposals which have potential for reducing the cost of the alias analysis. 1 Introduction To compete in speed with imperative languages, declarative languages need efficient methods for reclaiming unused memory. Mulkers et al. [16] developed a live structure analysis for logic programs which can determine at compile time when data structures become available for reuse. The advent of a language such as Mercury [18] motivates a refinement of this analysis, turning it into an efficient method. Though Mercury allows the ....

.... use: is there an alternative stored in a choice point such that the structure will be accessed by executing this alternative ffl Aliases: which structures share the same memory cells The contributions of the paper are: 1) to develop a backward use analysis (not present in Mulkers et al. [16]) 2) to propose various techniques with the potential of reducing the cost of the alias analysis, mainly by reducing the size of the description of the aliases and by avoiding costly changes in the type descriptions, and (3) to propose a module based analysis. 2 Preliminaries We assume programs ....

[Article contains additional citation context not shown here]

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for Prolog. ACM Transactions on Programming Languages and Systems, 16(2):205--258, Mar. 1994.

.... two prototype systems have been built [71, 67] Leuven has contributed by developing a widely used top down framework [3] and, together with UPM Madrid, by adapting the framework for constraint logic programming [40] It has a lot of experience in developing, implementing and comparing domains [6, 5, 41, 63, 65, 11, 64, 7]. The domains in [39, 38, 43] are focusing on specific properties of constraint logic programs. Recently, the Leuven group has also experimented with bottom up methods [8, 9, 10] and it has developed an abstract machine for implementing the generic top down framework [42] Finally, a very related ....

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for Prolog. ACM Transactions on Programming Languages and Systems, 16(2):205-- 258, March 1994.

.... 32 (0) 16 32 79 96. y Supported by the National Fund for Scientific Research. e mail: maurice cs.kuleuven.ac.be. z Supported by the National Fund for Scientific Research. e mail: gerda cs.kuleuven.ac.be. x Supported by EC, project HCM ABILE (CHRX CT94 0624) e mail: aka ida.liu.se. In [15], such an analysis has been developed for pure Prolog. The analysis is rather expensive. In a first phase, integrated types, type information integrated with mode information [11] have to be derived. Also the actual liveness analysis is rather complex, partly because the integrated types differ ....

....augmented with types, modes and determinism declarations. The analysis can be used to generate or check (in the latter case it becomes a local analysis at the clause level) uniqueness properties, or, even better to detect at which points memory cells become dead. The analysis is inspired by [15] but introduces a number of important innovations. ffl Liveness analyses developed so far have only considered forward liveness: whether the cell will be referenced by an execution which does not backtrack over the considered program point. Our analysis considers also backward liveness, i.e. ....

[Article contains additional citation context not shown here]

A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for Prolog. ACM Trans. Prog. Lang. Syst., 16(2):205--258, Mar. 1994.

No context found.

Mulkers, A., Winsborough, W. H., and Bruynooghe, M. 1994. Live-Structure Dataflow Analysis for Prolog. ACM Transactions on Programming Languages and Systems 16, 2, 205--258.

No context found.

Anne Mulkers, William Winsborough, and Maurice Bruynooghe. Live-structure dataflow analysis for Prolog. ACM Transactions on Programming Languages and Systems, 16(2), March 1994.

No context found.

Anne Mulkers, William Winsborough, and Maurice Bruynooghe. A live-structure data-flow analysis for Prolog. Theory Reort CW167, Katholieke Universitiet of Leuven, Belgium, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC