An engine for logic program analysis
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 318-328
- https://doi.org/10.1109/lics.1992.185544
Abstract
Most logic program analyzers employ a standard approachbased on abstract interpretation. At the coreof these is a generic algorithm or "engine" which isparameterized by an abstract domain. This standardengine is essentially a fixpoint computation over theabstract semantic equations of a program. This paperpresents a new engine which is based on unfolding ofsemantic equations. A main advantage of the unfoldingengine is a uniform treatment of structural informationin a program. In...Keywords
This publication has 3 references indexed in Scilit:
- A decision procedure for a class of set constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A finite presentation theorem for approximating logic programsPublished by Association for Computing Machinery (ACM) ,1990
- An application of abstract interpretation of logic programs: Occur check reductionPublished by Springer Nature ,1986