On the Inference of Natural Level Mappings

Martin, Jonathan C.; King, Andy

doi:10.1007/978-3-540-25951-0_13

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We follow a global approach to termination, i.e., require the existence of a function (level mapping) decreasing along all possible computation paths. A related technique of using two level-mappings has been recently investigated in [11]. The main difference is that Martin and King use the two level mappings separately for two different goals, i.e.…”

Section: Discussionmentioning

confidence: 99%

On Termination of Binary CLP Programs

Serebrenik¹,

Mesnard

2005

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to the fact that a number of approaches to termination of logic programs abstract the input program to a binary CLP program and conclude termination of the input program from termination of the abstracted program. In this paper we introduce a class of binary CLP programs such that their termination can be proved by using linear level mappings. We show that membership to this class is decidable and present a decision procedure. Further, we extend this class to programs such that their termination proofs require a combination of linear functions. In particular we consider as level mappings tuples of linear functions and piecewise linear functions.

show abstract

Section: Discussionmentioning

confidence: 99%

On Termination of Binary CLP Programs

Serebrenik¹,

Mesnard

2005

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…Indeed, the norm is used to define interargument relations, while the level mapping ensures rigidity and decrease. Further distinction between these two different functionalities has led to the recent work on "two level mappings approach" of Martin and King (2004). From the practical point of view, however, defining the level mapping | · | in terms of the norm · has an important advantage.…”

Section: Termination Analysis Of Logic Programsmentioning

confidence: 99%

Termination of Floating-Point Computations

Serebrenik

Schreye

2005

J Autom Reasoning

View full text Add to dashboard Cite

Numerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to (N, >); more recent works study termination of integer computations where the lack of well-foundedness of the integers has to be taken into account. Termination of computations involving floating-point numbers can be counterintuitive because of rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.

show abstract

On the Inference of Natural Level Mappings

Cited by 2 publications

References 19 publications

On Termination of Binary CLP Programs

On Termination of Binary CLP Programs

Termination of Floating-Point Computations

Contact Info

Product

Resources

About