P. Codognet, G. Fil#e, Computations, abstractions and constraints in logic programs, Proc. 4th Internat. Conf. on Programming Languages (ICCL'92), Oakland, CA, April 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....2. Mortgage repayment in CLP(IR Lin ) of bf=2 yields no useful groundness information, even though in fact the rst argument to bf=2 is ground if and only if the second is. The sign problem: The sign problem for Pos arises in the context of uniqueness analysis of linear arithmetic constraints [6, 2]. In this context, a Boolean function of the form (x y) z expresses that if the values of the variables x and y become uniquely determined, then the value of the variable z will have been determined as a result. A constraint such as x = y 1 is described by the Pos function x y and a ....

P. Codognet and G. File. Computations, abstractions and constraints in logic programs. In Proc. 4th IEEE Int. Conf. Computer Languages, pages 155-164. IEEE Comp. Soc. Press, 1992.

....has been formalized in [21, 20] in the framework of imperative languages, and has later been adopted for the analysis of functional and logic programming languages. There is a large body of work in static analysis of Logic Programming based on abstract interpretation and partial evaluation [8, 17, 18, 19, 38, 37, 39]. Some of the techniques used here, such as the encoding of computations via an and or tree [15] or the approximation of these computations using lattice theoretic notions, are common to these approaches, especially those based on top down analysis [23, 24, 34] However, the work presented here ....

P. Codognet and G. Fil'e. Computations, abstractions and constraints in logic programs. In Proc. of the 4th International Conference on Programming Languages (ICCL), Oakland, Ca, U.S.A, 1992.

....Van Hentenryck 1994; Muthukumar and Hermenegildo 1992; Van Roy and Despain 1992; Warren et al. 1988] Thus, it is natural to expect that this technique should also be useful in the context of CLP. A few general frameworks have already been defined for this purpose [Bruynooghe and Janssens 1992; Codognet and Fil e 1992; Giacobazzi et al. 1993; Marriott and Sndergaard 1990] However, one common characteristic of these frameworks is that they are either not implementation oriented or depart from the approaches that have been so far quite successful in the analysis of traditional logic programming (LP) languages. ....

....in the sense that they specify much of what is needed leaving only the definition of the domain, domain dependent functions, and assurance of correctness criteria to be provided by the implementor. It is our intention to develop a framework for CLP program analysis at this level of specification. Codognet and Fil e [1992] also present a quite general framework, for the description of both CLP languages and their static analyses, and an implementation approach. Although more concrete, their proposal is still more abstract than the level pointed out above as our objective. On the other hand they introduce the quite ....

[Article contains additional citation context not shown here]

Codognet, P. and Fil' e, G. 1992. Computations, abstractions and constraints in logic programs. In Proceedings of the 4th International Conference on Computer Languages, J. Cordy, Ed. IEEE Computer Society Press, Los Alamitos, Calif., 155--164.

....rooted in proof techniques and in reasoning about programs. On the other hand a widely accepted approach to program analysis is based on the notion of abstract interpretation. Abstract interpretation techniques have been proposed for many purposes, among others for groundness analysis, e.g. in [16, 17] and for type analysis e.g. in [27] The relation between proof based methods and abstract interpretation based methods is not obvious. We note here that the directional types, as discussed in this paper and in the related publications are prescriptive and concern the predicates while the ....

P. Codognet and G. Fil'e. Computations, abstractions and constraints in logic programs. In Proc. of the 4th Int. Conf. on Programming Languages, 1992.

....and a methodological point of view. Operational Frameworks The operational approach to abstract interpretation reduces to the idea of executing the program on a non standard (abstract) domain. This leads either to specific algorithms (e.g. 8, 2, 10] or to the so called operational frameworks [4, 6]. Those approaches are difficult to prove correct, to implement, and to modify, since they mix semantic and algorithmic aspects. A more systematic approach consists in separating both issues. Defining a new class of static analyses then reduces to the definition of a non standard fixpoint ....

P. Codognet and G. Fil`e. Computations, Abstractions and Constraints in Logic Programs. In Proceedings of the fourth International Conference on Programming languages (ICCL'92), Oakland, U.S.A., April 1992.

.... been mainly developed in the functional programming community, since it naturally appears as an application of the denotational semantics theory [23] More recently, it has also been extensively used in the logic programming community, but based on the mathematical structure of Galois insertion [4]. The use of Galois insertions was in fact first introduced by the Cousots in their landmark paper [7] in conjunction with the notion of collecting semantics. The collecting semantics basically is a reformulation of the standard semantics where concrete values are replaced by sets of concrete ....

P. Codognet and G. Fil'e. Computations, abstractions and constraints in logic programs. In Proceedings of the fourth International Conference on Computer Languages (ICCL'92), Oakland, U.S.A., April 1992.

....case for usual logic programming semantics. It is thus a natural setting for the development of powerful but simple approaches for static analysis based on the abstract interpretation paradigm. Some progress has already been made in this direction, in the context of constraint logic programming [45]. Fundamental to this approach is the notion of abstraction, or simulation, between constraint systems. It generalizes the notion of an abstract domain abstracting a concrete one [55] If a constraint system C 0 abstracts another constraint system C , then for each program computing on C , one ....

P. Codognet and G. Fil'e. Computations, abstractions and constraints in logic programs. Draft 1991.

....A number of practical systems have been built, some of which have shown great usefulness and practicality [18, 19, 17, 6, 3] It appears that the abstract interpretation technique should also be useful in the context of CLP. A few general frameworks have already been defined for this purpose [15, 4, 2]. However, one common characteristic of these frameworks is that they depart from the approaches that have been so far quite successful in the analysis of traditional logic programing (LP) languages. It is the point of this paper to show how some of the techniques which have been used to great ....

....they specify much of what is needed leaving only the definition of the domain, domain dependent functions, and assurance of correctness criteria to be provided by the implementor. It is our intention to develop a framework for CLP program analysis at this level of specification. Codognet and Fil e [4] also present a quite general framework for the description of both CLP languages and their static analyses and an implementation approach. Although more concrete, this proposal is still more abstract than the level pointed out above as our objective. On the other hand this paper introduces the ....

P. Codognet and G. Fil'e. Computations, Abstractions and Constraints in Logic Programs. In Fourth Int. Conf. on Programming Languages, April 1992.

....abstract interpretation consists in executing a program over a finite abstract domain which is a partition of the concrete Herbrand domain in order to get information about the concrete executions of the program. The idea of using constraint languages for this purpose has been proposed in [9, 10, 11], but only from a theoretical point of view. Here we use the abstract domain as the interpretation domain for the translated Toupie program. We only give here an informal presentation of the method. For a detailed discussion see [12, 13] This approach can be related to works on abstract ....

P. Codognet and G. Fil`e. Computations, Abstractions and Constraints in Logic Programs. In Proceedings of the IEEE International Conference on Computer Languages, ICCL'92. IEEE Press, 1992.

....P 0 : such execution is a data flow analysis of the execution of P by I. 3. Even if D is a finite set, the execution of P 0 by I can be not finite. In order to guarantee termination on finite domains, a loop check mechanism is added to I. This operational approach has been adopted in [3] for logic and constraint programs and in [10] for logic programs. In these works the interpreter used was simply a program (ND I) that nondeterministically traverses the LD trees. NDI was sufficient because no control built in like cut was considered, and thus, it was not necessary to model the ....

....the solutions of A are used to expand A 0 . In what follows A is called a solution call, since it produces solutions, whereas A 0 is called a look up call because it just looks up the solutions of A. The addition of a tabulation mechanism to St I gives rise to several problems that are new wrt [3, 10]. The main one is as follows. Assume that, according with the operational approach described above, the data flow analysis of a Prolog program P , is obtained by executing the corresponding program P 0 with the tabled interpreter St T I. If P has cuts, so will P 0 and they will be executed by ....

[Article contains additional citation context not shown here]

P. Codognet and G. Fil'e: Computations, abstractions and constraints in logic programs. In: Proc. Fourth International Conference on Programming Languages (ICCL'92), Oakland, U.S.A., April 1992.

No context found.

P. Codognet, G. Fil#e, Computations, abstractions and constraints in logic programs, Proc. 4th Internat. Conf. on Programming Languages (ICCL'92), Oakland, CA, April 1992.

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