Termination analysis for Mercury-Reference-Cited by-同舟云学术

Termination analysis for Mercury

Published:1997 Issue: Volume: Page:157-171
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Speirs Chris,Somogyi Zoltan,Søndergaard Harald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0032740

Reference16 articles.

1. K.R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. In Advances in Logic Programming Theory, pages 183–229. Oxford University Press, 1994.

2. Michel Berkelaar. lp-solve v. 2.0. ftp://ftp.es.ele.tue.ul/pub/lp-solve.

3. Roland N. Bol. Loop Checking in Logic Programming. PhD thesis, University of Amsterdam, The Netherlands, 1991.

4. A. Bossi, N. Cocco, and M. Fabris. Proving termination of logic programs by exploiting term properties. In S. Abramsky and T. S. E. Maibaum, editors, Proc. TAPSOFT'91, vol. 2, LNCS 494, pages 153–180. Springer-Verlag, 1991.

5. A. Bossi, N. Cocco, and M. Fabris. Typed norms. In B. Krieg-Brückner, editor, Proc. ESOP'92, LNCS 582, pages 73–92. Springer-Verlag, 1992.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proving termination of nonlinear command sequences;Formal Aspects of Computing;2013-05

2. A new look at the automatic synthesis of linear ranking functions;Information and Computation;2012-06

3. Proving Termination for Logic Programs by the Query-Mapping Pairs Approach;Program Development in Computational Logic;2004

4. Characterisations of Termination in Logic Programming;Program Development in Computational Logic;2004

5. Termination Analysis with Types Is More Accurate;Logic Programming;2003