Bottom-up abstract interpretation of logic programs

DOI10.1016/0304-3975(94)90055-8MaRDI QIDQ1318725zbMATH OpenOpenAlexFDO

Authors Michael Codish, Dennis Dams, Eyal Yardeni

Publication date 5 April 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)90055-8

zbMATH Keywords

magic setslogic programsprogram transformationcollecting semanticsconcurrent logic programsabstract substitutionabstract semantic functionbottom-up abstract interpretation

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Abstract interpretation and application to logic programs
• Efficient bottom-up execution of logic programs using abstract interpretation
• Publication:3201751
• A practical framework for theabstract interpretation of logic programs
• Publication:4506395
• scientific article; zbMATH DE number 4101138
• A terminological interpretation of (abductive) logic programming
• scientific article; zbMATH DE number 1497823
• Abstract interpretation based verification of logic programs

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 4008457 (Why is no real title available?)
• scientific article; zbMATH DE number 549958 (Why is no real title available?)
• A practical framework for theabstract interpretation of logic programs
• A type system for logic programs
• Compile-time derivation of variable dependency using abstract interpretation
• Declarative modeling of the operational behavior of logic languages
• Finite failures and partial computations in concurrent logic languages
• Magic templates: a spellbinding approach to logic programs
• Strictness analysis and denotational abstract interpretation
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases

Cited in

(26)

• Logical approximation for program analysis
• S-semantics for logic programming: a retrospective look
• The role of linearity in sharing analysis
• Type dependencies for logic programs using ACI-unification
• Abstract interpretation: a kind of magic
• The powerset operator on abstract interpretations
• Abstract interpretation and application to logic programs
• Exploiting linearity in sharing analysis of object-oriented programs
• Type inference in Prolog: A new approach
• Abstract interpretation of resolution-based semantics
• Efficient bottom-up execution of logic programs using abstract interpretation
• Lifting abstract interpreters to quantified logical domains
• Constrained dependencies
• A freeness and sharing analysis of logic programs based on a pre-interpretation
• scientific article; zbMATH DE number 4178750 (Why is no real title available?)
• A theory of observables for logic programs
• On the complexity of dataflow analysis of logic programs
• A practical framework for theabstract interpretation of logic programs
• Abstract interpretation based on Alexander Templates
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Magic-sets for localised analysis of Java bytecode
• Abstract interpretation of logic programs using magic transformations
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• scientific article; zbMATH DE number 3978439 (Why is no real title available?)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Bottom-up dataflow analysis of normal logic programs

This page was built for publication: Bottom-up abstract interpretation of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318725)