) Etalle S., Gabbrielli M., and Marchiori E., "A Transformation System for CLP with Dynamic Scheduling and CCP," in Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'97), volume 32, 12 of Sigplan Notices, ACM Press, pp. 137--150, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Partial Evaluation Framework for Curry Programs - Albert, Alpuente, Hanus, Vidal (1999) (Correct)
....than many existing methods for (constraint) logic programs with 1 Here is the concurrent conjunction operator, i.e. the expression e1 e2 is reduced by reducing either e1 or e2 , and : is the strict equality predicate. delays, in which suspended expressions cannot be unfolded (e.g. [14]) Secondly, the inference of safe evaluation annotations for the partially evaluated programs is far from trivial (see Example 4) In particular, we are forced to split resultants into several auxiliary (intermediate) functions in some cases to correctly preserve the answer expressions as well as ....
....the specialized functions. Despite the practical importance of logic programs with dynamic scheduling, there has been surprisingly little work devoted to their specialization. The only transformation framework that we are aware of for logic languages with delays is that of Etalle and Gabbrielli [14], which is based on the fold unfold approach to program transformation. It differs from our methodology, since our framework is based on the (automatic) PE approach and applies to logic languages with lazy functions. Moreover, we allow unfolding of suspended expressions at PE time, which is not ....
[Article contains additional citation context not shown here]
S. Etalle, M. Gabbrielli, and E. Marchiori. A Transformation System for CLP with Dynamic Scheduling and CCP. In Proc. of the ACM Sigplan PEPM'97, pages 137--150. ACM Press, New York, 1997.
LicenseScript - A Language and Framework for.. - Chong, Law, Etalle.. (2002) Self-citation (Etalle) (Correct)
.... of actions (play, upgrade, etc) that can take place, we can address the problem of the soundness of the system by reducing it to the problem of the correctness of the transformation system with respect to the chosen semantics, which is a problem that readily leverages the results of Etalle et al. [5, 4, 6]. 2.2 Verification In the framework depicted above, there are two aspects that require the development and use of verification tools. In the first place, the Information Monitors should be provided with tools that enable them to verify the integrity of the licenses and that allow them to trace ....
S. Etalle, M. Gabbrielli, and E. Marchiori. A transformation system for CLP with dynamic scheduling and CCP. In Partial evaluation and semantics-based program manipulation (PEPM), pages 137--150, Amsterdam, The Netherlands, Jun 1997. ACM Press, New York.
Partial Evaluation of Concurrent Constraint Languages - Etalle, Gabbrielli (1998) (4 citations) Self-citation (Gabbrielli) (Correct)
No context found.
Systems. To appear. Etalle, S., Gabbrielli, M., and Marchiori, E. 1997. A Transformation System for CLP with Dynamic Scheduling and CCP. In ACM{SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation (1997). ACM Press.
Properties of Input-Consuming Derivations - Bossi, Etalle, Rossi (1999) (1 citation) Self-citation (Etalle) (Correct)
.... It is important to notice that if we drop the nicely modedness condition the above Lemma would not hold any longer: it is not dicult to write a classical coroutining program which is not nicely moded for which the above lemma does not apply (see for instance the program reader writer in [16]) Corollary 4.4 Let the program P and the query Q : A; B be nicely moded. Suppose that : A; B 7 C 1 ; C 2 is a partial input consuming derivation of P [ fQg where C 1 and C 2 are obtained by partially resolving A and B, respectively. Then there exists a partial input consuming ....
S. Etalle, M. Gabbrielli, and E. Marchiori. A Transformation System for CLP with Dynamic Scheduling and CCP. In C. Consel, editor, ACM{SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation. ACM Press, 1997.
Properties of Input-Consuming Derivations - Bossi, Etalle, Rossi (1 citation) Self-citation (Etalle) (Correct)
....step. It is important to notice that if we drop the nicely modedness condition the above Lemma would not hold any longer: it is not dicult to write a classical coroutining program which is not nicely moded for which the above lemma does not apply (see for instance the program reader writer in [EGM97]) Corollary 3.12 Let the program P and the query Q : A;B be nicely moded. Suppose that : A;B 7 C 1 ; C 2 9 is a partial input consuming derivation of P [ fQg where C 1 and C 2 are obtained by partially resolving A and B, respectively. Then there exists a partial input consuming ....
S. Etalle, M. Gabbrielli, and E. Marchiori. A Transformation System for CLP with Dynamic Scheduling and CCP. In C. Consel, editor, ACM{ SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation. ACM Press, 1997.
Unfold/Fold Transformations of CCP programs - Sandro Etalle (1998) (2 citations) Self-citation (Etalle Gabbrielli) (Correct)
.... operation in our transformation system is the distribution, which consists of bringing an agent inside a choice as follows: from the agent A k P ask(c i ) B i , we want to obtain the agent P ask(c i ) A k B i ) This operation was introduced for the first time in the context of CLP in [7], and requires delicate applicability conditions, as it can easily introduce deadlock situation: consider for instance the following contrived program D. p(Y) q(X) k (ask(X = 0) tell(Y=0) q(0) stop In this program, the process D:p(Y) originates the derivation hD:p(Y) truei hD:stop; ....
.... of this transformation system will encompass an operation of non conservative guard expansion, analogous to the one of [17] and which if employed will necessarily lead to weaker correctness results) Concluding, we want to mention that a previous work of the authors on the subject is [7] which focuses primarily on CLP paradigm (with dynamic scheduling) and is concerned with the preservation of deadlock derivation along a transformation. In [7] for the first time, it was employed a transformation system in order to prove absence of deadlock of a program (HAMMING) The second ....
[Article contains additional citation context not shown here]
S. Etalle, M. Gabbrielli, and E. Marchiori. A Transformation System for CLP with Dynamic Scheduling and CCP. In ACM--SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation. ACM Press, 1997.
Partial Evaluation of Concurrent Constraints Languages - Etalle, Gabbrielli (1998) (4 citations) Self-citation (Etalle Gabbrielli) (Correct)
No context found.
Systems. Etalle, S., Gabbrielli, M., and Marchiori, E. 1997. A Transformation System for CLP with Dynamic Scheduling and CCP. In ACM--SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation (1997). ACM Press.
The Narrowing-Driven Approach to Functional Logic Program.. - Albert, Vidal (2002) (2 citations) (Correct)
No context found.
) Etalle S., Gabbrielli M., and Marchiori E., "A Transformation System for CLP with Dynamic Scheduling and CCP," in Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'97), volume 32, 12 of Sigplan Notices, ACM Press, pp. 137--150, 1997.
A Partial Evaluation Framework for Curry Programs - Albert, Alpuente, Hanus, Vidal (1999) (Correct)
No context found.
S. Etalle, M. Gabbrielli, and E. Marchiori. A Transformation System for CLP with Dynamic Scheduling and CCP. In Proc. of the ACM Sigplan PEPM'97, pages 137-150. ACM Press, New York, 1997.
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