A practical framework for theabstract interpretation of logic programs

DOI10.1016/0743-1066(91)80001-TzbMath0717.68010MaRDI QIDQ5748872

Maurice Bruynooghe

Publication date: 1991

Published in: The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

AND treesAND-OR graph

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17)

Related Items (24)

An overview of Ciao and its design philosophy ⋮ Certificate size reduction in abstraction-carrying code ⋮ Optimality in goal-dependent analysis of Sharing ⋮ Partial evaluation with inference rules ⋮ Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types ⋮ Incremental Analysis of Logic Programs with Assertions and Open Predicates ⋮ Computing Abstract Distances in Logic Programs ⋮ Precise goal-independent abstract interpretation of constraint logic programs. ⋮ Semantic code browsing ⋮ Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP ⋮ Unnamed Item ⋮ Abstract interpretation: a kind of magic ⋮ Abstraction-carrying code: a model for mobile code safety ⋮ Abstract conjunctive partial deduction for the analysis and compilation of coroutines ⋮ A framework for computing finite SLD trees ⋮ Constructive negation and constraint logic programming with sets ⋮ Improving precision of type analysis using non-discriminative union ⋮ Comparison of abstract interpretations ⋮ Incremental and Modular Context-sensitive Analysis ⋮ S-semantics for logic programming: a retrospective look ⋮ A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs ⋮ A theory of observables for logic programs ⋮ Bottom-up abstract interpretation of logic programs ⋮ Optimized algorithms for incremental analysis of logic programs

This page was built for publication: A practical framework for theabstract interpretation of logic programs