W. Vanhoof and M. Bruynooghe. When size does matter - Termination analysis for typed logic programs. In A. Pettorossi, editor, Logic-based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Selected Papers, volume 2372 of LNCS, pages 129-147. Springer-Verlag, 2002. 30  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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. ....

W. Vanhoof and M. Bruynooghe. When size does matter - Termination analysis for typed logic programs. In A. Pettorossi, editor, Logic-based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Selected Papers, volume 2372 of Lecture Notes in Computer Science, pages 129--147. Springer Verlag, 2002. 3

....user and is often considered the main missing link in automatic termination analysis [11] Termination analysers typically rely on the user to select a candidate norm. Recently, some new ideas which are easily integrated into existing analysers and facilitate automated norm selection emerged. In [26], a nite collection of norms is derived from the data types occurring in the program. The authors of [14] combine this collection in a single analysis and obtain a powerful system able to prove termination of programs not handled by previous implementations. The current paper extends these ideas ....

....typed variables need not be considered. All of the information required for termination analysis relevant to such types can be reconstructed from the polymorphic types. A preliminary investigation of the reuse of rigidity and size information based on polymorphic types are described in [6] and [26] respectively. However, these works focus mainly on monomorphic types and contain preliminary ideas for polymorphic types applicable only for simple instances of the polymorphic types. The reuse of analysis results about polymorphic predicates is an important step in supporting modular ....

[Article contains additional citation context not shown here]

W. Vanhoof and M. Bruynooghe. When size does matter - Termination analysis for typed logic programs. Logic Based Program Synthesis and Transformation, LOPSTR 2001, Revised Papers, LNCS, Springer 2002. To appear.

No context found.

W. Vanhoof and M. Bruynooghe. When size does matter - Termination analysis for typed logic programs. In A. Pettorossi, editor, Logic-based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Selected Papers, volume 2372 of LNCS, pages 129-147. Springer-Verlag, 2002. 30

No context found.

W. Vanhoof and M. Bruynooghe. When size does matter - Termination analysis for typed logic programs. In A. Pettorossi, editor, Logic-based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Selected Papers, volume 2372 of LNCS, pages 129--147. 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