S. Etalle and M. Gabbrielli. Layered Modes. JLP, 39:225--244, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint-Based Mode Analysis of Mercury - Overton, Somogyi, Stuckey (2002) (Correct)
.... analysis systems that do likewise work with much simpler domains (for example, Ground Prolog [9] recognizes only two instantiation states, free and ground) Other related work has been on mode checking for concurrent logic programming languages and for logic programming languages with coroutining [1, 5, 7]: there the emphasis has been on detecting communication patterns and possible deadlocks. The only other constraint based mode analysis we are aware of is that of Moded Flat GHC [4] Moded Flat GHC relies on position in the clause (in the head or guard versus in the body) to determine if a ....
S. Etalle and M. Gabbrielli. Layered Modes. JLP, 39:225--244, 1999.
Proving Deadlock Freedom of Logic Programs with Dynamic.. - Marchiori, Teusink (1996) (1 citation) (Correct)
....with the Prolog selection rule, can be adapted to deal also with logic programs with dynamic selection rules. However, since the verification conditions of these methods reflect the Prolog left to right selection rule, the obtained results are not very powerful. Recently, Etalle and Gabbrielli in [EG96] have generalized the proof method based on modes given in [AL95] by introducing a more expressive notion of mode (see e.g. AM94] called layered mode. Another method for proving deadlockfreedom has been given by Chambre and Deransart in [CD94] they use the approach developed in [DM93] for ....
....by integrating it with transformational techniques. We are actually investigating a technique, where one has to find a suitable specialization of the program with respect to the considered query that allows one to apply a compositional proof method, like our one or those developed in [AL95, EG96] to the resulting program. 5 Practical Instances of the Method In the previous section, we provided a method for proving programs deadlock free. However, there is no assumption on the assertion language to be used. In this section, we present two instances of the method, where the assertion ....
[Article contains additional citation context not shown here]
S. Etalle and M. Gabbrielli. Layered Modes. In Proc. of the JICSLP post-conference workshop on Verification and Analysis of Logic Programs , eds. F. de Boer and M. Gabbrielli, Bonn, Germany, 1996.
Mode Checking Using Constrained Regular Trees - Naish (1998) (3 citations) (Correct)
.... fact that the first argument is always a list and the second argument is a list if and only if the third argument is a list can be expressed by the constraints (empty X) Y Z (or more simply X, Y Z) Layered modes have been proposed as a more flexible alternative to directional types [EG96]. Our approach is more flexible still, and similar to the mode segments proposed for Ptah [Som89] Mode checking of constraints is done in a very similar way to = constraints. It is simplest to consider all non variable nodes to be labelled. For the type matching algorithm, in Case 1 if the ....
....algorithms for mode checking with multiset constraints. 7 Related work In terms of the application area, mode systems for logic programming, the most closely related work is that on directional types referred to earlier. This work does not support polymorphism. Even the work on layered modes [EG96] is less flexible than our use of constraints. Layered modes assign a directionality (input or output) and a timing to each argument. Output arguments depend on the input arguments with a smaller timing. The timings define a total order for the arguments. Using defines a partial order, ....
S. Etalle and M. Gabbrielli. Layered modes. In F. de Boer and M. Gabbrielli, editors, Proc. JICSLP'96 Post-Conference Workshop on Verification and Analysis of Logic Programs, 1996. Tehcnical Report TR-96-31, Dipartimento di Informatica di Pisa.
The (Lazy) Functional Side of Logic Programming - Etalle, Mountjoy (2000) Self-citation (Etalle) (Correct)
....scheme. This raises the interesting question of how large is the class of intrinsically logical programs. Without pretending to be able to characterize extensively this limit, it is interesting to notice that programs which are plain and consistent and which either admit a Layered Mode [EG96], or are S well typed programs [BM97] are safely translatable into Haskell (modulo the possibility of backtracking, which is discussed in the sequel) As argued in [EG96] we believe that these programs actually encompass the majority of actual programs which use logical variables in a ....
.... this limit, it is interesting to notice that programs which are plain and consistent and which either admit a Layered Mode [EG96] or are S well typed programs [BM97] are safely translatable into Haskell (modulo the possibility of backtracking, which is discussed in the sequel) As argued in [EG96], we believe that these programs actually encompass the majority of actual programs which use logical variables in a non elementary way. We think that a classi cation and understanding of these levels might be useful both to enhance the performance of logic languages (as already done to some ....
[Article contains additional citation context not shown here]
S. Etalle and M. Gabbrielli. Layered modes. In F. de Boer and M. Gabbrielli, editors, Proc. JICSLP'96 Post-Conference Workshop on Verication and Analysis of Logic Programs, 1996. Tehcnical Report TR-96-31, Dipartimento di Informatica di Pisa.
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