Formulation of induction formulas in verification of PROLOG programs
Proc. of the 8th international conference on Automated deduction
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Unfold/fold transformations and loop optimization of logic programs
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Specialisation of Prolog and FCP programs using abstract interpretation
New Generation Computing - Special Issue: Selected Papers from the Workshop on Partial Evaluation and Mixed
Equivalences of logic programs
Foundations of deductive databases and logic programming
Journal of Logic Programming
Recursive query processing: the power of logic
Theoretical Computer Science
Partial evaluation in logic programming
Journal of Logic Programming
Compiling bottom-up and mixed derivations into top-down executable logic programs
Journal of Automated Reasoning
Unfold/fold transformation of stratified programs
Theoretical Computer Science
Abstract interpretation based on OLDT resolution
Journal of Logic Programming
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Synthesis of Eureka Predicates for Developing Logic Programs
ESOP '90 Proceedings of the 3rd European Symposium on Programming
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Deep Logic Program Transformation Using Abstract Interpretation
Proceedings of the First Russian Conference on Logic Programming
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Extending partial deduction to tabled execution: some results and open issues
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
A framework for the integration of partial evaluation and abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An unfold/fold transformation framework for definite logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
An extension of OLDT based abstract interpretation for definite logic programs is presented. The extension can abstract the behavior of programs under different computation rules. The abstract behavior is captured in an EOLDT structure. It is shown that this EOLDT structure can guide an automatic equivalence preserving fold/unfold transformation. By making the appropriate choices during the abstract interpretation phase, one can obtain EOLDT structures which lead to a very broad range of transformations. It is argued that the approach provides a unifying framework for a large class of transformations.