Type analysis of Prolog using type graphs

This publication has 10 references indexed in Scilit:

• Combinations of abstract domains for logic programming
  Published by Association for Computing Machinery (ACM) ,1994
• Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
  ACM Transactions on Programming Languages and Systems, 1994
• Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation
  Software: Practice and Experience, 1993
• Compile-time derivation of variable dependency using abstract interpretation
  The Journal of Logic Programming, 1992
• Multiple specialization using minimal-function graph semantics
  The Journal of Logic Programming, 1992
• Deriving descriptions of possible values of program variables by means of abstract interpretation
  The Journal of Logic Programming, 1992
• A practical framework for theabstract interpretation of logic programs
  The Journal of Logic Programming, 1991
• Solving large combinatorial problems in logic programming
  The Journal of Logic Programming, 1990
• A finite presentation theorem for approximating logic programs
  Published by Association for Computing Machinery (ACM) ,1990
• 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