Universit`a di Pisa
by Fausto Spoto, Giorgio Levi
http://strudel.di.unipi.it/papers/./sub-19822-900410604/gulp97.ps.gz
Add To MetaCart
Abstract:
In this paper we propose a denotational semantics for Prolog and an approach to the abstract interpretation of Prolog programs; we deal with the control rules of Prolog and the analysis is proposed both for computed answers analysis and for call patterns analysis. In both cases the abstract semantics is finitely computable. Two examples show the usefulness of our approach for the analysis of Prolog programs.
Citations
| 246 | Abstract interpretation and application to logic programs – Cousot, Cousot - 1992 |
| 88 | Static analysis of logic programs for independent AND-parallelism – Jacobs, Langen - 1992 |
| 53 | Denotational and Operational Semantics for Prolog – Debray, Mishra - 1988 |
| 52 | Stepwise Development of Operational and Denotational Semantics for PROLOG – Jones, Mycroft - 1984 |
| 30 | Continuation semantics for Prolog with cut – Bruin, Vink - 1989 |
| 29 | Modelling Prolog Control – Barbuti, Codish, et al. - 1992 |
| 23 | An Abstract Interpretation Framework Which Accurately Handles Prolog Search-Rule and the Cut – Charlier, Rossi, et al. - 1994 |
| 20 | A logical operational semantics of full Prolog – Borger - 1990 |
| 15 | Oracle Semantics for Prolog – Barbuti, Codish, et al. - 1992 |
| 12 | Fixpoint semantics for PROLOG – Bossi, Bugliesi, et al. - 1993 |
| 6 | A Deterministic PROLOG Fixpoint Semantics – Fitting - 1985 |
| 4 | Analysis of Pure Prolog Programs – Levi, Micciancio - 1995 |
| 3 | Accurate Analysis of Prolog with Cut – Levi, Spoto - 1996 |

