有哪些信誉好的足球投注网站- 1、本文档共16页，可阅读全部内容。
- 2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
cTI A constraint-based termination inference tool for ISO-Prolog
a
r
X
i
v
:
c
s
/
0
3
0
9
0
2
8
v
1
[
c
s
.P
L
]
1
6
S
e
p
2
0
0
3
Under consideration for publication in Theory and Practice of Logic Programming 1
cTI: A Constraint-Based
Termination Inference Tool
for ISO-Prolog
FRED MESNARD
Iremia, Universite? de La Re?union, Saint Denis, France
(e-mail: fred@univ-reunion.fr)
ROBERTO BAGNARA
Department of Mathematics, University of Parma, Italy
(e-mail: bagnara@cs.unipr.it)
Abstract
We present cTI, the first system for universal left-termination inference of logic programs.
Termination inference generalizes termination analysis and checking. Traditionally, a ter-
mination analyzer tries to prove that a given class of queries terminates. This class must be
provided to the system, for instance by means of user annotations. Moreover, the analysis
must be redone every time the class of queries of interest is updated. Termination infer-
ence, in contrast, requires neither user annotations nor recomputation. In this approach,
terminating classes for all predicates are inferred at once. We describe the architecture of
cTI and report an extensive experimental evaluation of the system covering many classical
examples from the logic programming termination literature and several Prolog programs
of respectable size and complexity.
KEYWORDS: Termination Inference; Termination Analysis; Logic Programming; Ab-
stract Interpretation.
1 Introduction
Termination is a crucial aspect of program verification. It is of particular impor-
tance for logic programs (Lloyd 1987; Apt 1997), since there are no a priori syn-
tactic restrictions to queries and, as a matter of fact, most predicates programmers
tend to write do not terminate for their most general queries. In the last fifteen
years, termination has been the subject of several research works in the field of
logic programming (see, for instance, (Francez et al. 1985; Apt and Pedreschi 1990;
Ruggieri 1999)). In contrast to what happens for other programming paradigms,
there are two notion
您可能关注的文档
- Charlotte+Brontes+Feminine+consciousness+in+Jane+Eyre.pdf
- Charm Dalitz Plot Analysis Formalism and Results.pdf
- Charm and beauty production at CDF.pdf
- Charm Estimate from the Dilepton Spectra.pdf
- Charm and beauty of the Large Hadron Collider.pdf
- Charm Hadron Production Fractions.pdf
- Charm coalescence at relativistic energies.pdf
- Charm Leptonic and Semileptonic Decays.pdf
- Charm meson production from meson-nucleon scattering.pdf
- Charm meson resonances in $D to P ell nu$ decays.pdf
文档评论（0）