J. P. Gallagher and G. Puebla. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In Practical Aspects of Declarative Languages, PADL 2002, volume 2257 of LNCS, pages 243--261, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
When Size Does Matter - Termination Analysis for Typed.. - Vanhoof, Bruynooghe (2002) (3 citations) (Correct)
....can be obtained by applying a type substitution on the declared type of the predicate. In a language like Mercury [24] types and type declarations are de ned by the user and the compiler checks for type correctness. However, it is also feasible to infer a correct typing based on methods such as [13]. In what follows, we assume that programs are in normal form. A program is in normal form if each atom is of the form p(X 1 ; Xn ) X = Y or X = f(X 1 ; Xn ) with X 1 ; Xn ) di erent variables) In a type correct program, X and Y have the same type in X = Y and, if X is ....
....under a more instantiated variable typing. Neither [11] nor [19] de nes a size relation analysis using the de ned norms. While the advantages of using types that are declared by the programmer are well known, for analysis purposes it might be useful to use a sophisticated analysis like [13] to derive the types that are used in a program rather than using (only) the declared types. Consider for example a term of type pair(T ) where the latter type is de ned as pair(T ) list(T ) list(T ) Both lists have the same type and consequently, both are taken into account when counting ....
[Article contains additional citation context not shown here]
John Gallagher and German Puebla. Abstract interpretation over nondeterministic nite tree automata for set-based analysis of logic programs. In Shriram Krishnamurthi and C. R. Ramakrishnan, editors, Practical Aspects of Declarative Languages, PADL 2002, Proceedings, volume 2257 of LNCS, pages 243{
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) Self-citation (Gallagher) (Correct)
No context found.
J. P. Gallagher and G. Puebla. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In Practical Aspects of Declarative Languages, PADL 2002, volume 2257 of LNCS, pages 243--261, 2002.
Combining Norms to Prove Termination - Genaim, Codish, Gallagher, Lagoon (2002) (2 citations) Self-citation (Gallagher) (Correct)
....could either be declared or inferred, and we do not even require that the types are correct, although we are more likely to derive useful norms for proving termination if the types are correct and accurate. Our aim is to generate norms from the types inferred by a recent type inference system [14]. This system does not use a widening to introduce recursive types. This means that recursion in the inferred types always re ects some recursive dependency in the program itself. For this reason it seems a promising starting point for deriving norms for termination analysis. 2 Preliminaries ....
....selected from a prede ned collection (like listlength, termsize, etc, or de ned by the user. Alternatively the user can supply types (inferred or declared) and specify that the analyser should use a combination of the corresponding typed norms. For regular types we use the analyser described in [14]. The termination analyser can be accessed at http: wwww.cs.bgu.ac.il mcodish TeminWeb. 6 Related Work The idea of using type information to de ne norms has previously been studied by Bossi et al. 3] Martin et al. 20] Decorte et al. 10 12] and more recently by Vanhoof and Bruynooghe [23] ....
J. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In Fourth International Symposium on Practical Aspects of Declarative Languages, LNCS. Springer-Verlag, January 2002. Accepted for publication.
Termination Analysis of Typed Logic Programs - Lagoon, Mesnard, Stuckey.. (2003) (Correct)
No context found.
J. Gallagher and G. Puebla. Abstract interpretation over non-deterministic nite tree automata for set-based analysis of logic programs. In S. Krishnamurthi and C. R. Ramakrishnan, editors, Proceedings of the 4th Int. Symp. on Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 243-261. Springer-Verlag, Berlin, 2002.
More Precise Yet Efficient Type Inference for Logic Programs - Vaucheret, Bueno (Correct)
No context found.
J. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In Fourth International Symposium on Practical Aspects of Declarative Languages, LNCS, pages 243-261. Springer-Verlag, January 2002.
Termination Analysis with Types is More Accurate - Lagoon, Mesnard, Stuckey (2003) (1 citation) (Correct)
No context found.
J. Gallagher and G. Puebla. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. SAS, LNCS 2257:243--261, 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