Complementing Logic Program Semantics

@inproceedings{Giacobazzi1996ComplementingLP,
  title={Complementing Logic Program Semantics},
  author={Roberto Giacobazzi and Francesco Ranzato},
  booktitle={ALP},
  year={1996}
}
We consider abstract interpretation, and in particular the basic operators of reduced product and complementation of abstract domains, as a tool to systematically derive denotational semantics by composition and decomposition. Reduced product allows to perform the logical conjunction of semantics, while complementation characterizes what is left from a semantics when the information concerning a given observable property is “subtracted” from it. We apply this idea to the case of logic… 

A characterization of symmetric semantics by domain complementation

It is proved that under suitable hypothesis the semantics abstraction commutes with respect to domain complementation, allowing us to prove that angelic and demonic/in nite semantics are complementary and provide a minimal decomposition of all natural-style trace-based, relational, denotational, Dijkstra's predicate transformer and Hoare's axiomatic semantics.

Transforming semantics by abstract interpretation

Compositionality in the puzzle of semantics

It is proved that most well-known compositional semantics of imperative programs, such as the standard denotational and weakest precondition semantics can be systematically derived as solutions of simple abstract domain equations.

Complementation in abstract interpretation

It is shown that the complement exists in most coses, and it is applied complementation to three well-know abstract domains, notably to Cousot and Cousot's interval domain for integer variable analysis, and to the domain Sharing for aliasing analysis of logic languages.

Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements

It is shown how to reconstruct the model-theoretic characterization of the well-known s-semantics using pure order- theoretic concepts only, and it is shown that uniform closures capture precisely the property of a refinement of being invertible.

Abstract interpretation of resolution-based semantics

Optimal Domains for Disjunctive Abstract Intepretation

Computing the Reduced Product of Program Analyses

  • L. Lu
  • Computer Science
  • 2007
A reduction relation between abstract domains is introduced to identify situations where computation of the reduced products of program analyses can be made more eecient, by computing the reduced product of groundness and pair sharing analyses of logic programs.

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming

This work surveys some general principles and methodologies for program analysis and verification of abstract interpretation and model checking techniques, and on their applications to constraint logic programs.

References

SHOWING 1-10 OF 26 REFERENCES

Declarative Modeling of the Operational Behavior of Logic Languages

Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics

It is proved that the abstract domain Def for ground-dependency analysis of logic programs can be systematically derived by autodependencies of a more abstract (and simple) domain for pure groundness analysis.

Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns

This paper first shows how the Ω-semantics can model these observables when the selection rule is not taken into account, and defines a suitable immediate consequence operator, and hence a fixpoint semantics, for partial answers and call patterns which considers also the selectionRule.

"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics

A definition of a hierarchy of collecting semantics, including well known semantics for logic programs, and a constructive characterization for the “best” collecting semantics for analysis are presented.

Complementation in abstract interpretation

It is shown that the complement exists in most coses, and it is applied complementation to three well-know abstract domains, notably to Cousot and Cousot's interval domain for integer variable analysis, and to the domain Sharing for aliasing analysis of logic languages.

Compositional Optimization of Disjunctive Abstract Interpretations

It is shown that the least disjunctive basis exists in most cases, and its properties are studied in relation with reduced product of abstract interpretations, providing advanced algebraic methods for domain manipulation and optimization.

Abstract Interpretation and Application to Logic Programs

The Semantics of Predicate Logic as a Programming Language

In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.

A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs

A new notion or truth on Herbrand interpretations extended with variables is defined which allows us to capture, by means of suitable models, various observable properties, such as the ground success set, the set of atomic consequences, and the computed answer substitutions operational semantics.

Complementation of Abstract Domains made Easy

This work decomposes Sharing in three more abstract domains whose reduced product gives back Sharing, and decomposes each component corresponds to one of the three properties that coexist in the elements of Sharing : ground-dependency, pair-sharing and set-sharing.