A Program Transformation for Backwards Analysis of Logic Programs
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 92-105
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Meta-circular Abstract Interpretation in Prolog2002
- Inferring Termination Conditions for Logic Programs Using Backwards AnalysisLecture Notes in Computer Science, 2001
- A Theory of Observables for Logic ProgramsInformation and Computation, 2001
- A semantic basis for the termination analysis of logic programsThe Journal of Logic Programming, 1999
- A logical model for relational abstract domainsACM Transactions on Programming Languages and Systems, 1998
- Resultant semantics for prologJournal of Logic and Computation, 1996
- The s-semantics approach: Theory and applicationsThe Journal of Logic Programming, 1994
- Abstract interpretation of logic programs using magic transformationsThe Journal of Logic Programming, 1994
- Goal independency and call patterns in the analysis of logic programs1994
- Magic sets and other strange ways to implement logic programs (extended abstract)1985