In this paper we propose a precise goal-independent abstract interpretation of Prolog programs. We deal with the control rules of Prolog and the cut operator. Moreover, we get a simple denotation for negation as finite failure. The abstract analysis is proposed both for computed answers analysis and for call patterns analysis. In both cases the abstract semantics is finitely computable.
Abstract Interpretation of Prolog Programs
SPOTO, Nicola Fausto;
1999
Abstract
In this paper we propose a precise goal-independent abstract interpretation of Prolog programs. We deal with the control rules of Prolog and the cut operator. Moreover, we get a simple denotation for negation as finite failure. The abstract analysis is proposed both for computed answers analysis and for call patterns analysis. In both cases the abstract semantics is finitely computable.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Abstract-interpretation-of-prolog-programs.pdf
solo utenti autorizzati
Tipologia:
Versione dell'editore
Licenza:
Accesso ristretto
Dimensione
265.71 kB
Formato
Adobe PDF
|
265.71 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
