The s-semantics approach: Theory and applications

Bossi, Annalisa; Gabbrielli, Maurizio; Levi, Giorgio; Martelli, Maurizio

doi:10.1016/0743-1066(94)90026-4

Cited by 103 publications

(59 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, by (9) and the inductive hypothesis on k, there exists an input consuming derivation δ : Bσ 0 ϑ2 −→ C where C ⊆ I and Bσ 0 ϑ 2 ≈ Bσ 0 σ 1 .…”

Section: Appendixmentioning

confidence: 99%

See 1 more Smart Citation

Termination of simply moded logic programs with dynamic scheduling

Bossi

Etalle

Rossi

et al. 2004

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the leftto-right one of Prolog. Input consuming derivations were introduced to model dynamic scheduling while abstracting from the technical details. In this article, we provide a sufficient and necessary criterion for termination of input consuming derivations of simply moded logic programs. The termination criterion we propose is based on a denotational semantics for partial derivations which is defined in the spirit of model-theoretic semantics previously proposed for left-to-right derivations.

show abstract

“…Hence, by (9) and the inductive hypothesis on k, there exists an input consuming derivation δ : Bσ 0 ϑ2 −→ C where C ⊆ I and Bσ 0 ϑ 2 ≈ Bσ 0 σ 1 .…”

Section: Appendixmentioning

confidence: 99%

“…Their semantics is the analogue of the bottom-up Ssemantics [9] for usual logic programs, where atoms are mapped to their set of answers. In this respect, it corresponds to the semantics defined in [6].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Termination of simply moded logic programs with dynamic scheduling

Bossi

Etalle

Rossi

et al. 2004

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

show abstract

“…The function lookup resolves the method call according to the runtime type of the object, and returns the signature of the method to be invoked. The concrete denotational semantics of a program is defined as the least fixpoint (lfp) of the following transformer of interpretations [Bossi et al 1994]. …”

Section: A Simple Object-oriented Languagementioning

confidence: 99%

Inference of Field-Sensitive Reachability and Cyclicity

Zanardini

Genaim

2014

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the structure pointed to by x.fld, and allows bounding the number of iterations of a loop which traverses the data structure on fld.In general, proving termination needs acyclicity, unless program-specific or non-automated reasoning is performed. However, recent work could prove that certain loops terminate even without inferring acyclicity, because they traverse data structures "acyclically". Consider a double-linked list: if it is possible to demonstrate that every cycle involves both the "next" and the "prev" field, then a traversal on "next" terminates since no cycle will be traversed completely.This paper develops a static analysis inferring field-sensitive reachability and cyclicity information, which is more general than existing approaches. Propositional formulae are computed, which describe which fields may or may not be traversed by paths in the heap. Consider a tree with edges "left" and "right" to the left and right sub-trees, and "parent" to the parent node: termination of a loop traversing leaf-up cannot be guaranteed by state-of-the-art analyses. Instead, propositional formulae computed by this analysis indicate that cycles must traverse "parent" and at least one between "left" and "right": termination is guaranteed as no cycle is traversed completely.This paper defines the necessary abstract domains and builds an abstract semantics on them. A prototypical implementation provides the expected result on relevant examples.

show abstract

“…Moreover, our analysis focusses on standard Herbrand interpretations [2,29]. Many efforts have been devoted to define compositional semantics by using extended interpretations containing possibly non-ground atoms (e.g., see [6,22]). The relation between these semantics and the semantics based on standard Herbrand interpretations is summarised in [1].…”

Section: T (O {∪})mentioning

confidence: 99%

On the Semantics of Logic Program Composition

Brogi

2004

Program Development in Computational Logic

View full text Add to dashboard Cite

Abstract. This paper aims at offering an insightful synthesis of different compositional semantics for logic program composition which have been developed in the literature. In particular, we will analyse the notions of program equivalence, compositionality, and full abstraction for logic programs. We will show how the notion of supported interpretation provides a unifying compositional model-theoretic characterisation both of positive programs and of programs containing negation.

show abstract

The s-semantics approach: Theory and applications

Cited by 103 publications

References 38 publications

Termination of simply moded logic programs with dynamic scheduling

Termination of simply moded logic programs with dynamic scheduling

Inference of Field-Sensitive Reachability and Cyclicity

On the Semantics of Logic Program Composition

Contact Info

Product

Resources

About