Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs

This publication has 21 references indexed in Scilit:

• Constraint-based termination analysis of logic programs
  ACM Transactions on Programming Languages and Systems, 1999
• Worst-case groundness analysis using positive Boolean functions
  The Journal of Logic Programming, 1999
• A semantic basis for the termination analysis of logic programs
  The Journal of Logic Programming, 1999
• Prolog: The Standard
  Published by Springer Nature ,1996
• Estimating the computational cost of logic programs
  Published by Springer Nature ,1994
• Reasoning about Termination of Pure Prolog Programs
  Information and Computation, 1993
• Abstract interpretation and application to logic programs
  The Journal of Logic Programming, 1992
• Studies in Pure Prolog: Termination
  Published by Springer Nature ,1990
• Automatic discovery of linear restraints among variables of a program
  Published by Association for Computing Machinery (ACM) ,1978
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
  Published by Association for Computing Machinery (ACM) ,1977