A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers.
Reexecution-Based Analysis of Logic Programs with Delay Declarations.
CORTESI, Agostino;ROSSI, Sabina
2001-01-01
Abstract
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
psi01.ps
non disponibili
Tipologia:
Documento in Pre-print
Licenza:
Accesso chiuso-personale
Dimensione
186.49 kB
Formato
Postscript
|
186.49 kB | Postscript | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
