Ranking Functions for Size-Change Termination II-Reference-Cited by-同舟云学术

Ranking Functions for Size-Change Termination II

Published:2009-05-25 Issue:2 Volume:5 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Ben-Amram Amir,Lee Chin Soon

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference13 articles.

1. Amir M. Ben-Amram. Size-change termination with difference constraints.ACM Transactions on Programming Languages and Systems, 2007. to appear.

2. A complexity tradeoff in ranking-function termination proofs

3. Amir M. Ben-Amram and Michael Codish. A SAT-based approach to size change termination with global ranking functions. In C.R. Ramakrishnan and Jakob Rehof, editors,14th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 5028 ofLNCS, pages 46-55. Springer, 2008.

4. Amir M. Ben-Amram and Chin Soon Lee. Size-change analysis in polynomial time.ACM Transactions on Programming Languages and Systems, 29(1), 2007.

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

1. Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems;Lecture Notes in Computer Science;2015

2. An Abstract Domain to Infer Ordinal-Valued Ranking Functions;Programming Languages and Systems;2014

3. Monotonicity Constraints for Termination in the Integer Domain;Logical Methods in Computer Science;2011-08-24

4. MONOTONICITY CONSTRAINTS FOR TERMINATION IN THE INTEGER DOMAIN;LOG METH COMPUT SCI;2011

5. Loop Summarization and Termination Analysis;Tools and Algorithms for the Construction and Analysis of Systems;2011