Reexecution-Based Analysis of Logic Programs with Delay Declarations

14 years 3 months ago

Download www.dsi.unive.it

A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known reﬁnement techniques based on reexecution. The and abstract semantics express both deadlock information and qualiﬁed answers.

Agostino Cortesi, Baudouin Le Charlier, Sabina Ros

Real-time Traffic

Abstract Semantics | Delay Declarations | ERSHOV 2001 | General Semantics-based Framework | Theoretical Computer Science |

claim paper

» A Declarative View of Inheritance in Logic Programming

» Properties of inputconsuming derivations

» Semantics and Termination of SimplyModed Logic Programs with Dynamic Scheduling

» Whats in a model Epistemological analysis of Logic Programming

» Interactive scalable declarative program analysis from prototype to implementation

» Type Analysis for CHIP

» Declarative Semantics of Input Consuming Logic Programs

» Inference of WellTypings for Logic Programs with Application to Termination Analysis

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	ERSHOV
Authors	Agostino Cortesi, Baudouin Le Charlier, Sabina Rossi

Comments (0)

Sciweavers

Reexecution-Based Analysis of Logic Programs with Delay Declarations

Abstract Semantics | Delay Declarations | ERSHOV 2001 | General Semantics-based Framework | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers