Transforming constraint logic programs

Bensaou, N.; Guessarian, Irène

doi:10.1016/s0304-3975(97)00077-7

Cited by 16 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, an extension of the Tamaki-Sato method to CLP programs has also been proposed by Bensaou and Guessarian [3], yet there are some substantial differences between [3] and our proposal.…”

Section: Discussionmentioning

confidence: 83%

“…Among the works on program's transformations, the most closely related to this paper are Maher's [29] and the one of Bensaou and Guessarian [3].…”

Section: Discussionmentioning

confidence: 99%

“…Firstly, just as in the case of the operation defined in [29], also the folding defined in [3] is very restrictive in that it lacks the possibility of introducing recursion.…”

Section: Discussionmentioning

confidence: 99%

“…For instance, the new system was then adapted by Sato to full first-order programs [33]. Related work has been done by Maher [29], Gardner and Shepherdson [16], Aravidan and Dung [2], Seki [35], Bossi and Cocco [5] and Bensaou and Guessarian [3]. Among these papers only [3,29] treated the case of Constrain Logic Programming.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Transformations of CLP modules

Etalle¹,

Gabbrielli

1996

Theoretical Computer Science

107

View full text Add to dashboard Cite

We propose a transformation system for Constraint Logic Programming (CLP) programs and modules. The framework is inspired by the one of Tamaki and Sato (1984) for pure logic programs. However, the use of CLP allows us to introduce some new operations such as splitting and constraint replacement. We provide two sets of applicability conditions. The first one guarantees that the original and the transformed programs have the same computational behaviour, in terms of answer constraints. The second set contains more restrictive conditions that ensure compositional#y: we prove that under these conditions the original and the transformed modules have the same answer constraints also when they are composed with other modules. This result is proved by first introducing a new formulation, in terms of trees, of a resultants semantics for CLP. As corollaries we obtain the correctness of both the modular and the nonmodular system w.r.t, the least model semantics.

show abstract

Section: Discussionmentioning

confidence: 83%

“…Among the works on program's transformations, the most closely related to this paper are Maher's [29] and the one of Bensaou and Guessarian [3].…”

Section: Discussionmentioning

confidence: 99%

“…Firstly, just as in the case of the operation defined in [29], also the folding defined in [3] is very restrictive in that it lacks the possibility of introducing recursion.…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Transformations of CLP modules

Etalle¹,

Gabbrielli

1996

Theoretical Computer Science

107

View full text Add to dashboard Cite

show abstract

“…Unfold/fold transformations have been studied for various declarative programming languages such as functional languages [Burstall and Darlington 1977;Kott 1985;Sands 1996], logic programming [Tamaki and Sato 1984;Sato 1992;Pettorossi and Proietti 1998], constraint logic programming [Maher 1993;Etalle and Gabbrielli 1996;Bensaou and Guessarian 1998], concurrent constraint programming [Etalle et al 2001], and process algebraic specification languages (e.g. CCS) [Francesco and Santone 1998].…”

Section: Introductionmentioning

confidence: 99%

An unfold/fold transformation framework for definite logic programs

Roychoudhury

Kumar

Ramakrishnan

et al. 2004

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Given a logic program P , an unfold/fold program transformation system derives a sequence of programs P = P 0 , P 1 , . . . , P n , such that P i+1 is derived from P i by application of either an unfolding or a folding step. Unfold/fold transformations have been widely used for improving program efficiency and for reasoning about programs. Unfolding corresponds to a resolution step and hence is semantics-preserving. Folding, which replaces an occurrence of the right hand side of a clause with its head, may on the other hand produce a semantically different program. Existing unfold/fold transformation systems for logic programs restrict the application of folding by placing (usually syntactic) conditions that are sufficient to guarantee the correctness of folding. These restrictions are often too strong, especially when the transformations are used for reasoning about programs. In this article we develop a transformation system (called SCOUT) for definite logic programs that is provably more powerful (in terms of transformation sequences allowed) than existing transformation systems. This extra power is needed for a novel use of logic program transformations: for the verification of a specific class of concurrent systems, called parameterized concurrent systems.Our transformation system is constructed by developing a framework, which is parameterized by a "measure space" and associated measure functions. This framework places no syntactic restriction on the application of folding, and it can be used to derive transformation systems (by fixing the measure space and functions). The power of the system is determined by the choice of the measure space and functions; thus the relative power of different transformation systems can be compared by considering their measure spaces and functions. The correctness of these transformation systems follows from the correctness of the framework. We show that various existing transformation A preliminary version of this article appeared in the • 465 systems can be obtained as instances of our framework. We extend the unfold/fold transformation framework with a goal replacement transformation that allows semantically equivalent conjunctions of atoms to be interchanged. We then derive a new transformation system SCOUT as an instance of the framework and show its power relative to the existing transformation systems. SCOUT has been used to inductively prove temporal properties of parameterized concurrent systems (infinite families of finite state concurrent systems). We demonstrate the use of the additional power of SCOUT in constructing such induction proofs.

show abstract