A method for specializing logic programs

Bossi, Annalisa; Cocco, Nicoletta; Dulli, Susi

doi:10.1145/78942.78947

Cited by 41 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…atom measure and clause measure ( lo hi ), if for all A 2 M(P), we have : (1) Allgr ound proofs of A in P are w e akly measure c onsistent w.r.t. and ( lo hi ) (2) A has a ground proof in P which is strongly measure c onsistent w.r.t. and ( lo hi ) We a r e n o w ready to de ne the abstract conditions on folding and constraints on how the clause measures are to be updated after an unfold/fold step.…”

Section: Measures Measure-consistent Proofs and Total Correctnessmentioning

confidence: 99%

“…Maher described a system that permits only reversible folding 10]. The basic Tamaki-Sato system itself was extended in several directions (e.g., to handle folding with multiple clauses 7], negation 1,18,19]) and applied to practical problems (e.g., 2,3,12]). (See 11] for an excellent s u r v ey of research on this topic over the past decade).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Roychoudhury

Kumar

Ramakrishnan

et al. 1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0 , P1 , : : : , Pn , s u c h t h a t Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for de nite logic programs di er from one another mainly in the kind of folding transformations they permit at each step. Some allow folding using a single (possibly recursive) clause while others permit folding using multiple non-recursive clauses. However, none allow folding using multiple recursive clauses that are drawn from some previous program in the transformation sequence. In this paper we develop a parameterized framework for unfold/fold transformations by suitably abstracting and extending the proofs of existing transformation systems. Various existing unfold/fold transformation systems can be obtained by instantiating the parameters of the framework. This framework enables us to not only understand the relative strengths and limitations of these systems but also construct new transformation systems. Speci cally we present a more general transformation system that permits folding using multiple recursive clauses that can be drawn from any previous program in the transformation sequence. This new transformation system is also obtained by instantiating our parameterized framework.

show abstract

Section: Measures Measure-consistent Proofs and Total Correctnessmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Roychoudhury

Kumar

Ramakrishnan

et al. 1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Similarly, on-line 14 partial evaluation of full Prolog programs [Prestwich 1992b;Sahlin 1991;Sahlin 1993], constraint logic programs [Smith 1991;Smith and Hickey 1990], functional programs [Sperber 1996;Weise et al 1991], and indeed program transformation in general [Bossi et al 1990;Burstall and Darlington 1977;Futamura et al 1991;Pettorossi and Proietti 1994;Wadler 1990] is likely to benefit from adapted versions of our techniques for ensuring termination, performing generalization, and determining polyvariance. A further investigation of these conjectures will be the subject of future work.…”

Section: Further Discussionmentioning

confidence: 99%

Controlling generalization and polyvariance in partial deduction of normal logic programs

Leuschel

Martens

Schreye

1998

ACM Trans. Program. Lang. Syst.

114

View full text Add to dashboard Cite

Given a program and some input data, partial deduction computes a specialized program handling any remaining input more efficiently. However, controlling the process well is a rather difficult problem. In this article, we elaborate global control for partial deduction: for which atoms, among possibly infinitely many, should specialized relations be produced, meanwhile guaranteeing correctness as well as termination? Our work is based on two ingredients. First, we use the concept of a characteristic tree, encapsulating specialization behavior rather than syntactic structure, to guide generalization and polyvariance, and we show how this can be done in a correct and elegant way. Second, we structure combinations of atoms and associated characteristic trees in global trees registering "causal" relationships among such pairs. This allows us to spot looming nontermination and perform proper generalization in order to avert the danger, without having to impose a depth bound on characteristic trees. The practical relevance and benefits of the work are illustrated through extensive experiments. Finally, a similar approach may improve upon current (on-line) control strategies for program transformation in general such as (positive) supercompilation of functional programs. It also seems valuable in the context of abstract interpretation to handle infinite domains of infinite height with more precision.

show abstract

“…There are also additional possible optimizations we developed using partial evaluation techniques [3] on the TD rules.…”

Section: Optimizationmentioning

confidence: 99%

Implementing Reflective Access Control in SQL

Olson

Gunter

Cook

et al. 2009

Data and Applications Security XXIII

View full text Add to dashboard Cite

Abstract. Reflective Database Access Control (RDBAC)is a model in which a database privilege is expressed as a database query itself, rather than as a static privilege in an access control matrix. RDBAC aids the management of database access controls by improving the expressiveness of policies. The Transaction Datalog language provides a powerful syntax and semantics for expressing RDBAC policies, however there is no efficient implementation of this language for practical database systems. We demonstrate a strategy for compiling policies in Transaction Datalog into standard SQL views that enforce the policies, including overcoming significant differences in semantics between the languages in handling side-effects and evaluation order. We also report the results of evaluating the performance of these views compared to policies enforced by access control matrices. This implementation demonstrates the practical feasibility of RDBAC, and suggests a rich field of further research.

show abstract

A method for specializing logic programs

Cited by 41 publications

References 16 publications

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Controlling generalization and polyvariance in partial deduction of normal logic programs

Implementing Reflective Access Control in SQL

Contact Info

Product

Resources

About