C. Mellish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of declarative languages, pp. 181--198. Ellis Horwood, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we show that the class of safe programs and the safe transformation rules are general enough to allow signi cant program specializations. Our notions of safe programs and transformation rules, and also the notion of determinism are based on the modes which are associated with predicate calls [31, 48]. We describe these notions in Section 5, where we also prove that the application of safe transformation rules preserve the operational semantics of safe programs. Then, in Section 6, we introduce a strategy, called Determinization, for applying our safe transformation rules in an automatic way, ....

....occurs in an input argument of the head predicate or it is a local variable of the disequation. 5 Program Transformations based on Modes Modes provide information about the directionality of predicates, by specifying whether an argument should be used as input or output (see, for instance, [31, 48]) Mode information is very useful for specifying and verifying logic programs [2, 10] and it is used in existing compilers, such as Ciao and Mercury, to generate very ecient code [19, 44] Mode information has also been used in the context of program transformation to provide sucient conditions ....

[Article contains additional citation context not shown here]

C. S. Mellish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declaratice Languages, chapter 8, pages 181-198. Ellis Horwood, 1987.

....4.1. Section 4 describes the mode analysis in detail and the compilation rather brie y. 4.1 Mode Analysis The purpose of the mode analysis is to obtain information for the compilation by statically analyzing data ow that will happen at run time. Thus it is a kind of abstract interpretation [10]. While the previous paper used two modes for the analysis, we now use the following four modes and assign one of them to each argument of the body goals of a clause: 11 (input) The preceding computation (or the top level goal clause) guarantees that this argument is instantiated to a ....

Mellish, C. S., Abstract Interpretation of Prolog Programs. In Proc. Third Int. Conf. on Logic Programming, Shapiro, E. (ed.), LNCS 225, Springer-Verlag, 1986, pp. 463-474.

....in this domain consist of conjunctions of variables and equivalences between variables. For example, x 1 x 2 ) x 3 (x 1 x 4 ) We call this class of formulae EP os. Like P os, EP os is ordered by j= It is interesting to note that EP os is only slightly richer than its subdomain Con [15, 18] which consists of conjunctions of variables. However, as we shall see, EP os gives much greater precision than Con for groundness analysis of logic programs. Moreover, it shares with Con the important property that its longest chain has linear length. The proof of this result relies on the ....

C. Mellish. Abstract Interpretation of Prolog Programs. In Third International Conference on Logic Programming, pages 463-474. Springer, 1986. LNCS 225.

....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 ....

C. Mellish. Abstract interpretation of prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 181--198. Ellis Horwood, Chichester, U.K., 1987.

.... the characteristics of the program, have motivated a growing interest in dataflow analysis of CLP languages and, in particular, in the application of abstract interpretation [Cousot and Cousot 1977] Much work has been done using the abstract interpretation technique in the context of LP (e.g. Mellish [1986], Debray [1989] Bruynooghe [1991] Marriott and Sndergaard [1989] and Debray [1992b] A number of systems have been built, some of which have shown the potential usefulness and practicality of this technique [Bueno et al. 1994; Debray 1992b; Le Charlier and Van Hentenryck 1994; Muthukumar and ....

Mellish, C. 1986. Abstract interpretation of Prolog programs. In Proceedings of the 3rd International Conference on Logic Programming, E. Shapiro, Ed. Lecture Notes in Computer Science, vol. 225. Springer-Verlag, Berlin, 463--475.

....de ned on the data descriptions. Evolution of program analysis tools In the context of logic based languages, early attempts to apply abstract interpretation were mainly ad hoc approaches to program analysis aiming to derive speci c information, usually about modes, types or variable dependencies [39, 24, 10, 25, 23]. Recent years have witnessed immense e orts devoted to the design and implementation of tools to aid in the semantics based analysis of logic programs. The brief survey presented here is by no means complete; however the state of the art of these tools is continuously advancing. In addition to ....

C. Mellish. Abstract Interpretation of Prolog Programs. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, number 225 in LNCS, pages 463-474, London, July 1986. SpringerVerlag.

....only for expressing properties; it must also be chosen for how accurately it propagates information. Thus, it is frequent that an abstract domain contains more values than is strictly necessary for expressing a property. For instance, an early domain for groundness 4 analysis of logic programs [Mel86] contained such values as, e.g. non ground terms with a xed functor or terms made of a functor applied to free variables . A popular abstract domain for properties like groundness is Pos [CFW91, MS93] In this domain, predicates are abstracted in propositional formulas (e.g. the rst and ....

C. S. Mellish. Abstract interpretation of Prolog programs. In E. Shapiro, editor, 3rd Int. Conf. Logic Programming, volume 225 of LNCS, pages 181-198. Springer-Verlag, 1986.

....Our method can also be used to verify the consistency of user supplied mode declarations. Such a consistency verification for user supplied mode declarations is necessary because of errors which may be made by the user. One can use this mode inference to improve the efficiency of logic programs [2, 3, 4, 6, 9, 11, 12, 13, 16, 22] or to control the evaluation of logic programs [14] or to prove the completeness of SLDNF resolution for a large class of programs [20, 21] 3 Preliminaries and motivating examples Let V be a countably infinite set of variables, for each n 0 a countably infinite set F of function symbols be ....

....6 Descriptive mode inference The mode of an n ary predicate symbol with respect to a program represents statement about computations that are possible from it. From this claim mode information has been studied for the sake of making logic programs as efficient as functional or imperative ones [2, 3, 4, 6, 9, 11, 12, 13, 16, 22]. Our aim in this section is to automatically infer the mode of an n ary predicate symbol from a given logic program while conserving the mathematical intention of a relation. This is a descriptive mode inference. Hence, our interest is not focused on a syntactic mode declaration of logic ....

C. S. Mellish. Abstract interpretation of prolog programs. Lecture Notes in Computer Science, 225:463--474, 1986.

....or abstract data can also be used as an analysis technique called abstract interpretation. The abstraction might, for instance, throw away all details of the data except for its type or its mode 7 . Running a logic program on this abstract data can be used to infer its type or mode signature, Mellish, 1987 ] One of the most successful extensions to logic programming is to combine it with constraint reasoning, called constraint logic programming, Ja#ar and Maher, 1994 ] Formulae are divided between those to be treated by logic programming and those to be treated as constraints. The latter are ....

C. S. Mellish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 181--197. Ellis Horwood, 1987.

.... analysis requires that the concrete operation f and the corresponding abstract operation abs f be related as follows: for every x in the concrete computational domain, f(x) v fl(abs f (ff(x) Though the idea of abstract interpretation has been applied to logic programs by various researchers [1, 17, 18, 19, 23, 25], relatively few practical implementations appear to have actually been reported in the 1 A preliminary version of this paper appeared in Proc. 1988 International Conference on Logic Programming. The work of M. Hermenegildo was supported in part by MCC s Deductive Computing Lab. and also in part ....

C.S. Mellish. Abstract Interpretation of Prolog Programs. In Third International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, pages 463--475. Imperial College, Springer-Verlag, July 1986.

....for efficient analysis. Hence we need to handle constraints with considerable expressive power. For instance, rather than representing only the range of values each variable can take, constraints should be able to express relationships among variables. Abstract interpretation approaches (such as [Bru91, Mel87, LMV91]) do not represent such relationships explicitly, and thus do not directly accommodate our formulation. 1 As mentioned above, we derive necessary conditions for success of a rule from the success and context conditions of predicates used in that rule. With an appropriate indexing scheme, these ....

C. S. Mellish. Abstract interpretation of Prolog programs. In S. Abramski and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 8, pages 181--198. Ellis Horwood, 1987.

.... programming languages [21] Data dependency information is useful in various optimizing transformations of logic programs [7] in improving the backtracking behavior of programs [3] and parallelizing logic programs [2, 27] Early work on mode inference via static analysis was done by Mellish [16 18], who used dependencies between variables to propagate information regarding their instantiation. This approach, however, had the drawback that builtin predicates such as = 2 could not be handled very precisely; moreover, since aliasing effects resulting from unification were not taken into ....

....information regarding their instantiation. This approach, however, had the drawback that builtin predicates such as = 2 could not be handled very precisely; moreover, since aliasing effects resulting from unification were not taken into account, the procedure sometimes produced erroneous results [18]. A more syntactic approach to mode inference, based on the simple mode set in, out , was proposed by Reddy in connection with work on transforming logic programs into functional languages [21] This approach, however, applied only to a restricted class of logic programs and often tended to be ....

C. S. Mellish, Abstract Interpretation of Prolog Programs, in Proc. Third International Logic Programming Conference, London, July 1986. Springer-Verlag LNCS vol. 225.

.... consists of a general theory for approximating the semantics of computations of programs [10] Abstract interpretation has had a number of successful applications in logic based programming languages (for instance, 12] and [24] In particular, work on abstract interpretation of Prolog programs [28, 41] has provided us with tools for gathering information on different aspects of systems and analysing it (e.g. directionality of predicates [13] program optimisation [8] and understanding [5] The class of KBS s we target are closely related to logic programming and we have detected an ....

C. Mellish. Abstract Interpretation of Prolog Programs. In Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.

....executions, with advantages and drawbacks, as explained in Subsection 4.1 below. When a concrete interpreter is employed, then the slicing is dynamic; if abstract interpretation [8] is used then the slicing is said static. We show below the concrete mode annotated execution for query List = [1,23,5], s c(List,SL,CL) using a normalized version of the s c 3 program of Section 1 (with literal positions) fList=fg h0; 1; List = 1,23,5]i fList=gg fList=g; SL=f ; CL=fg h0; 2; s c(List,SL,CL)i fList=g; SL=g; CL=gg fL=f ; Sum=f ; Count=fg h1; 0; s c(L,Sum,Count)i fL=g; Sum=f ; Count=fg fA=fg ....

....is dynamic; if abstract interpretation [8] is used then the slicing is said static. We show below the concrete mode annotated execution for query List = 1,23,5] s c(List,SL,CL) using a normalized version of the s c 3 program of Section 1 (with literal positions) fList=fg h0; 1; List = [1,23,5]i fList=gg fList=g; SL=f ; CL=fg h0; 2; s c(List,SL,CL)i fList=g; SL=g; CL=gg fL=f ; Sum=f ; Count=fg h1; 0; s c(L,Sum,Count)i fL=g; Sum=f ; Count=fg fA=fg h1; 1; A = 0i fA=gg fB=fg h1; 2; B = 0i fB=gg fL=g; A=g; Sum=f ; B=g; Count=fg h1; 3; s c(L,A,Sum,B,Count)i fL=g; A=g; Sum=g; B=g; ....

[Article contains additional citation context not shown here]

C. Mellish. Abstract Interpretation of Prolog Programs. In Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.

No context found.

C. Mellish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of declarative languages, pp. 181--198. Ellis Horwood, 1987.

No context found.

C. Mellish. Abstract interpretation of prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 181--198. Ellis Horwood, Chichester, U.K., 1987.

No context found.

C.S. Mellish. Abstract Interpretation of Prolog Programs. In Third International Conference on Logic Programming, number 225 in LNCS, pages 463--475. Springer-Verlag, July 1986.

No context found.

C.S. Mellish. Abstract Interpretation of Prolog Programs. In Third International Conference on Logic Programming, number 225 in LNCS, pages 463--475. Springer-Verlag, July 1986.

No context found.

C.S. Mellish. Abstract Interpretation of Prolog Programs. In Third International Conference on Logic Programming, number 225 in LNCS, pages 463--475. Springer-Verlag, July 1986.

No context found.

C. Mellish. Abstract Interpretation of Prolog Programs. In Third International Conference on Logic Programming, number 225 in LNCS, pages 463-475. Springer-Verlag, July 1986.

No context found.

C. Mellish. Abstract Interpretation of PROLOG Programs. In S. Abramsky and C. H. E. Horwood, editors, Abstract Interpretation of Declarative Languages, pages 181--198, 1987.

No context found.

C. Mellish. Abstract Interpretation of PROLOG Programs. In S. Abramsky and C. H. E. Horwood, editors, Abstract Interpretation of Declarative Languages, pages 181--198, 1987.

No context found.

C. Mellish. Abstract Interpretation of Prolog Programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 181--198. Ellis Horwood Ltd, 1987.

No context found.

C. Mellish, Abstract Interpretation of Prolog Programs, Ellis Horwood, Chichester, 1987, pp. 181--198.

No context found.

C. S. Mellish, "Abstract Interpretation of Prolog Programs", Proc. Third International Conference on Logic Programming, London, July 1986. Springer-Verlag LNCS vol. 225.

First 50 documents

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