Incremental analysis of constraint logic programs
Global analyzers traditionally read and analyze the entire program at once, in a
nonincremental way. However, there are many situations which are not well suited to this …
nonincremental way. However, there are many situations which are not well suited to this …
Transformations of CLP modules
S Etalle, M Gabrielli - Theoretical computer science, 1996 - Elsevier
We propose a transformation system for Constraint Logic Programming (CLP) aprograms
and modules. The framework is inspired by the one of Tamaki and Sato (1984) for pure logic …
and modules. The framework is inspired by the one of Tamaki and Sato (1984) for pure logic …
Analyzing logic programs using “prop”-ositional logic programs and a magic wand
This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of
complex properties of logic programs. Analyses are performed by abstracting Prolog …
complex properties of logic programs. Analyses are performed by abstracting Prolog …
Compositional analysis of modular logic programs
This paper describes a semantic basis for a compositional approach to the analysis of logic
programs. A logic program is viewed as consisting of a set of modules, each module …
programs. A logic program is viewed as consisting of a set of modules, each module …
Abstract diagnosis
We show how declarative diagnosis techniques can be extended to cope with verification of
operational properties, such as computed and correct answers, and of abstract properties …
operational properties, such as computed and correct answers, and of abstract properties …
Non-standard semantics for program slicing
R Giacobazzi, I Mastroeni - Higher-Order and Symbolic Computation, 2003 - Springer
In this paper we generalize the notion of compositional semantics to cope with transfinite
reductions of a transition system. Standard denotational and predicate transformer …
reductions of a transition system. Standard denotational and predicate transformer …
Incremental and modular context-sensitive analysis
I Garcia-Contreras, JF Morales… - Theory and Practice of …, 2021 - cambridge.org
Context-sensitive global analysis of large code bases can be expensive, which can make its
use impractical during software development. However, there are many situations in which …
use impractical during software development. However, there are many situations in which …
A model-theoretic semantics for defeasible logic
MJ Maher - arXiv preprint cs/0207086, 2002 - arxiv.org
Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof
theory and, until now, has had no model theory. In this paper a model-theoretic semantics is …
theory and, until now, has had no model theory. In this paper a model-theoretic semantics is …
A theory of observables for logic programs
We define a semantic framework to reason about properties of abstractions of SLD-
derivations. The framework allows us to address problems such as the relation between the …
derivations. The framework allows us to address problems such as the relation between the …