Abstract

A new framework for abstract interpretation of logic programs is presented. The idea is to take as the basis a simplified semantics that approximates the standard operational semantics of logic programs but still makes it possible to derive non-trivial abstract interpretations. The relative simplicity of the basic semantics facilitates systematic derivation of abstract interpretations and static analyses of logic programs. Sufficient conditions for termination and correctness of the derived interpreters are provided. The approach is illustrated by inferring groundness information for an example program.KeywordsLogic ProgramComplete LatticeAbstract InterpretationStatic SemanticAbstract DomainThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.