Pages that link to "Item:Q1318725"

The following pages link to Bottom-up abstract interpretation of logic programs (Q1318725):

Displaying 20 items.

• Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
• Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
• Abstract interpretation: a kind of magic (Q673498) (← links)
• Efficient bottom-up execution of logic programs using abstract interpretation (Q689638) (← links)
• Exploiting linearity in sharing analysis of object-oriented programs (Q737080) (← links)
• S-semantics for logic programming: a retrospective look (Q1035702) (← links)
• Abstract interpretation of resolution-based semantics (Q1035705) (← links)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
• Type inference in Prolog: A new approach (Q1311964) (← links)
• Constrained dependencies (Q1391931) (← links)
• Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
• A theory of observables for logic programs (Q1854446) (← links)
• Logical approximation for program analysis (Q1929363) (← links)
• The powerset operator on abstract interpretations (Q1960538) (← links)
• Lifting abstract interpreters to quantified logical domains (Q3189843) (← links)
• (Q3742761) (← links)
• Bottom-up dataflow analysis of normal logic programs (Q4012707) (← links)
• The role of linearity in sharing analysis (Q5055490) (← links)
• On the complexity of dataflow analysis of logic programs (Q5204343) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)