M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. In Static Analysis, SAS 2002, volume 2477 of LNCS, pages 477--492, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Proving Termination With Adornments - Serebrenik, De Schreye (Correct)
....programming (see e.g. 1, 5, 7, 9] Termination proofs often are based on the concept of a norm (a level mapping) a function mapping terms (atoms) of the program to the natural numbers. Recently, using type information became a prominent trend in termination analysis for symbolic computations [2, 3, 13]. On the other hand, the study of termination of numerical programs led to the emerging of the adorning technique [11, 12] Both approaches are based on the idea of distinguishing between different subsets of values for variables, and deriving norms and level mappings based on these subsets. ....
....The key notion of the integrated framework is the notion of a set of adornments, partitioning the domain of the predicates arguments into a finite set of pairwise disjoint segments. A set of adornments is usually derived from the program itself. As a basis for a set of adornments one can use types [2], sets of integers [11] and even interargument relations [8] Given a program and a set of adornments, the program can be transformed such that a predicate p in the transformed program P is called if and only if the corresponding predicate p is called in the original program P and the ....
M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. In M. V. Hermenegildo and G. Puebla, editors, Static Analysis, 9th International Symposium, volume 2477 of Lecture Notes in Computer Science, pages 477--492. Technical University of Madrid (Spain), School of Computer Science, Springer Verlag, 2002.
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) Self-citation (Bruynooghe) (Correct)
No context found.
M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. In Static Analysis, SAS 2002, volume 2477 of LNCS, pages 477--492, 2002.
Reuse of Results in Termination Analysis of Typed.. - Bruynooghe, Codish.. (2002) (4 citations) Self-citation (Bruynooghe Codish Genaim Vanhoof) (Correct)
....is sucient to consider norms corresponding to the polymorphic types without those for the types in the speci c contexts in which they appear. We discuss related work in Section 5 and conclude in Section 6. A full version of this paper including detailed proofs and additional examples appears as [5]. 2 Type Information We assume familiarity with logic programming concepts [19, 1] We consider the set of terms constructed from a given set of function symbols and variables V and use the notations f=n and p=n for an n ary functor and predicate respectively. We adopt a standard notion of ....
....And Let: n ) n ) denote the size relation and rigidity information with respect to a type de nition which is an instance of . Then: 9X : i = P i ) 9X : i i ) Proof: A proof sketch is in [5]. 2 In practice the analyser uses widening while computing the size relations; this can lead to di erences in precision between the results obtained via reuse and the results obtained via direct computation. Only experience can show whether there is a relevant di erence. Example 7. Consider again ....
M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. Technical Report, July, 2002.
Termination Analysis of Typed Logic Programs - Lagoon, Mesnard, Stuckey.. (2003) (Correct)
No context found.
Maurice Bruynooghe, Michael Codish, Samir Genaim, and Wim Vanhoof. Reuse of results in termination analysis of typed logic programs. In Static Analysis, 9th International Symposium, volume 2477 of Lecture Notes in Computer Science, pages 477-492. Springer-Verlag, 2002.
Termination Analysis with Types is More Accurate - Lagoon, Mesnard, Stuckey (2003) (1 citation) (Correct)
No context found.
M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. SAS, LNCS 2477:477--492, 2002.
Proving Termination With Adornments - Alexander Serebrenik Danny (Correct)
No context found.
M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. In M. V. Hermenegildo and G. Puebla, editors, Static Analysis, 9th International Symposium, volume 2477 of Lecture Notes in Computer Science, pages 477--492. Springer Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC