Combinations of abstract domains for logic programming: open product and generic pattern construction
Authors:
- Agostino CortesiAgostino Cortesi
- Baudouin Le CharlierBCBaudouin Le Charlier
- Pascal Van HentenryckPHPascal Van Hentenryck
- 1 August 2000
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 38 (1-3) , 27-71
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Automated verification of Prolog programsThe Journal of Logic Programming, 1999
- Optimal groundness analysis using propositional logicThe Journal of Logic Programming, 1996
- Evaluation of the domain propThe Journal of Logic Programming, 1995
- Type analysis of prolog using type graphsThe Journal of Logic Programming, 1995
- Global flow analysis as a practical compilation toolThe Journal of Logic Programming, 1992
- Multiple specialization using minimal-function graph semanticsThe Journal of Logic Programming, 1992
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- A practical framework for theabstract interpretation of logic programsThe Journal of Logic Programming, 1991
- Solving large combinatorial problems in logic programmingThe Journal of Logic Programming, 1990
- Denotational and operational semantics for prologThe Journal of Logic Programming, 1988