Verschaetse, K. 1992. Static termination analysis for denite Horn clause programs. Ph.D. thesis, Dept. Computer Science, K.U.Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.  Home/Search   Document Not in Database   Summary   Related Articles

....of work. Here, the issue was to revisit the solutions proposed for all these components in the initial termination analysis approaches and to improve on them, at least in terms of precision. This line of research includes work on inferring norms and level mappings from mode and type information ([Verschaetse 1992; Decorte et al. 1993; Martin et al. 1996] automatic inference of interargument and size relations ( De Schreye and Verschaetse 1995; Brodsky and Sagiv 1991; Lindenstrauss and Sagiv 1997] automatic veri cation of the well founded constraints (for instance through CLP techniques) De Schreye ....

....de ned as a linear combination of the sizes of the terms on xed (per predicate) argument positions. That is, it is de ned as j(p(t 1 ; t n )j = X i2Ip jjt i jj; for some I p f1; ng and for some norm jj:jj: The set I p is frequently selected to be the set of input positions. [Verschaetse 1992] describes how to automatically propose the set I p and calls the resulting level mappings natural level mappings. We return to the concept with more detail in Section 4. 6 Stefaan Decorte, Danny De Schreye, Henk Vandecasteele 2.3 Acceptability wrt a set of atoms In automatic termination ....

[Article contains additional citation context not shown here]

Verschaetse, K. 1992. Static termination analysis for denite Horn clause programs. Ph.D. thesis, Dept. Computer Science, K.U.Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.

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