Bottom-up abstract interpretation of logic programs
From MaRDI portal
Publication:1318725
DOI10.1016/0304-3975(94)90055-8zbMath0795.68038OpenAlexW1983385612MaRDI QIDQ1318725
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
program transformationlogic programsmagic setscollecting semanticsconcurrent logic programsabstract substitutionabstract semantic functionbottom-up abstract interpretation
Related Items (13)
The role of linearity in sharing analysis ⋮ Constrained dependencies ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ The powerset operator on abstract interpretations ⋮ Magic-sets for localised analysis of Java bytecode ⋮ Abstract interpretation: a kind of magic ⋮ On the complexity of dataflow analysis of logic programs ⋮ Exploiting linearity in sharing analysis of object-oriented programs ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ S-semantics for logic programming: a retrospective look ⋮ Type dependencies for logic programs using ACI-unification ⋮ A theory of observables for logic programs ⋮ Type inference in Prolog: A new approach
Cites Work
- Declarative modeling of the operational behavior of logic languages
- Finite failures and partial computations in concurrent logic languages
- Strictness analysis and denotational abstract interpretation
- The Alexander Method - a technique for the processing of recursive axioms in deductive databases
- Magic templates: a spellbinding approach to logic programs
- Compile-time derivation of variable dependency using abstract interpretation
- A practical framework for theabstract interpretation of logic programs
- A type system for logic programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bottom-up abstract interpretation of logic programs
