Conference Proceeding

On the Practicality of Abstract Equation Systems.

01/1995;
Source: DBLP
0 0
 · 
0 Bookmarks
 · 
19 Views
  • Source
    Article: Abstracting Unification: A Key Step in the Design of Logic Program Analyses
    Maurice Bruynooghe
    [show abstract] [hide abstract]
    ABSTRACT: ing Unification: A Key Step in the Design of Logic Program Analyses Maurice Bruynooghe 1 and Michael Codish 2 and Anne Mulkers 1 1 K.U.Leuven, Department of Computer Science, Celestijnenlaan 200A, 3001 Heverlee, Belgium 2 Ben-Gurion University, Department of Mathematics and Computer Science, P.O.B. 653, 84105 Beer-Sheva, Israel Abstract. This paper focuses on one of the key steps in the design of semantic based analyses for logic programs --- the definition of an abstract unification algorithm for a given notion of data description. We survey some of the major notions of data descriptions proposed in the context of mode and sharing analyses. We demonstrate how a careful and systematic analysis of the underlying concrete unification algorithm contributes to the design of the abstract algorithm. Several relevant properties of concrete substitutions which influence the design of abstract domains and algorithms are described. We make use of a novel representation called abstract eq...
    02/1970;
  • Source
    Conference Proceeding: Efficient Top-Down Set-Sharing Analysis Using Cliques.
    Jorge A. Navas, Francisco Bueno, Manuel V. Hermenegildo
    Practical Aspects of Declarative Languages, 8th International Symposium, PADL 2006, Charleston, SC, USA, January 9-10, 2006, Proceedings; 01/2006
  • Source
    Article: An algebraic approach to sharing analysis of logic programs
    Michael Codish, Vitaly Lagoon, Francisco Bueno
    [show abstract] [hide abstract]
    ABSTRACT: This paper describes an algebraic approach to the sharing analysis of logic programs based on an abstract domain of set logic programs. Set logic programs are logic programs in which the terms are sets of variables and unification is based on an associative, commutative, and idempotent equality theory. All of the basic operations required for sharing analyses, as well as their formal justification, are based on simple algebraic properties of set substitutions and set-based atoms. An ordering on set-based syntactic objects, similar to “less general” on concrete syntactic objects, is shown to reflect the notion of “less sharing” information. The (abstract) unification of a pair of set-based terms corresponds to finding their most general ACI1 unifier with respect to this ordering. The unification of a set of equations between set-based terms is defined exactly as in the concrete case, by solving the equations one by one and repeatedly applying their solutions to the remaining equations. We demonstrate that all of the operations in a sharing analysis have natural definitions which are both correct and optimal.
    The Journal of Logic Programming.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Full-text

View
0 Downloads
Available from