Termination of well-moded programs

S Etalle; A Bossi; N Cocco

doi:10.1016/S0743-1066(98)10025-0

Termination of well-moded programs

S Etalle, A Bossi, N Cocco^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization - in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150-176 - of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check. (C) 1999 Elsevier Science Inc, All rights reserved.

Original language	English
Pages (from-to)	243-257
Number of pages	15
Journal	Journal of Logic Programming
Volume	38
Issue number	2
DOIs	https://doi.org/10.1016/S0743-1066(98)10025-0
Publication status	Published - Feb 1999

Keywords

termination
well-moded programs
modular proofs
LOGIC PROGRAMS
PROVING TERMINATION
PROLOG PROGRAMS

Access to Document

10.1016/S0743-1066(98)10025-0Licence: Unspecified

https://research.utwente.nl/files/6430709/etalle.pdfLicence: Free access - publisher

Cite this

@article{2974018d077b4c4295226e7c6e02e066,

title = "Termination of well-moded programs",

abstract = "We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization - in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150-176 - of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check. (C) 1999 Elsevier Science Inc, All rights reserved.",

keywords = "termination, well-moded programs, modular proofs, LOGIC PROGRAMS, PROVING TERMINATION, PROLOG PROGRAMS",

author = "S Etalle and A Bossi and N Cocco",

year = "1999",

month = feb,

doi = "10.1016/S0743-1066(98)10025-0",

language = "English",

volume = "38",

pages = "243--257",

journal = "Journal of Logic Programming",

issn = "0743-1066",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Termination of well-moded programs

AU - Etalle, S

AU - Bossi, A

AU - Cocco, N

PY - 1999/2

Y1 - 1999/2

N2 - We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization - in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150-176 - of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check. (C) 1999 Elsevier Science Inc, All rights reserved.

AB - We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization - in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd (Ed.), Proceedings of the Simposium in Computational Logic, Springer, Berlin, 1990, pp. 150-176 - of the property of being terminating. This characterization enjoys the properties of being compositional and, to some extent, of being easy to check. (C) 1999 Elsevier Science Inc, All rights reserved.

KW - termination

KW - well-moded programs

KW - modular proofs

KW - LOGIC PROGRAMS

KW - PROVING TERMINATION

KW - PROLOG PROGRAMS

U2 - 10.1016/S0743-1066(98)10025-0

DO - 10.1016/S0743-1066(98)10025-0

M3 - Article

SN - 0743-1066

VL - 38

SP - 243

EP - 257

JO - Journal of Logic Programming

JF - Journal of Logic Programming

IS - 2

ER -

Termination of well-moded programs

Abstract

Keywords

Access to Document

Fingerprint

Cite this