Fine-Grained Goal-Dependent Declarative Analysis of Logic Programs
Download:
|
|
by Dmitri Boulanger
http://www.dsi.unive.it/~bossi/ILPSWORKS/dimitri.ps.gz
Add To MetaCart
Abstract:
An approach to analyze logic-based software systems has been suggested in [3, 4, 5, 7]. It exploits the clean transparent declarative semantics of logic programming languages to provide a basis for verification and optimization of complex applications, such as constraint
Citations
| 255 | Abstract interpretation and application to logic programs – Cousot, Cousot - 1992 |
| 115 | The s-semantics approach: Theory and applications – Bossi, Gabbrielli, et al. - 1994 |
| 29 | Practical Model-Based Static Analysis for Definite Logic Programs – Gallagher, Boulanger, et al. - 1995 |
| 16 | A systematic construction of abstract domains – Boulanger, Bruynooghe - 1994 |
| 2 | Analysis of Logic-Based Systems – Boulanger |
| 2 | Complete Analysis for Definite Logic – Boulanger - 1995 |
| 2 | Equivalence of Logic Programs,Foundations of Deductive Databases and Logic Programming – Maher - 1988 |
| 2 | The Declarative Side of Magic,to be published – Mascellani |
| 1 | Analyzing Declarative Semantics of Logic Programs – Boulanger |
