Proving termination of nonlinear command sequences-Reference-Cited by-同舟云学术

Proving termination of nonlinear command sequences

Published:2013-05 Issue:3 Volume:25 Page:389-403
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Babić Domagoj¹,Cook Byron²,Hu Alan J.³,Rakamarić Zvonimir⁴

Affiliation:

1. Computer Science Division, University of California, Berkeley, USA

2. Microsoft Research and University College London, London, UK

3. Department of Computer Science, University of British Columbia, Vancouver, Canada

4. School of Computing, The University of Utah, Salt Lake City, USA

Abstract

Abstract We describe a simple and efficient algorithm for proving the termination of a class of loops with nonlinear assignments to variables. The method is based on divergence testing for each variable in the cone-of-influence of the loop’s condition. The analysis allows us to automatically prove the termination of loops that cannot be handled using previous techniques. We also describe a method for integrating our nonlinear termination proving technique into a larger termination proving framework that depends on linear reasoning.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-012-0252-5.pdf

Reference30 articles.

1. Bouajjani A Bozga M Habermehl P Iosif R Moro P Vojnar T (2006) Programs with lists are counter automata. In: Proceedings of international conference on computer aided verification (CAV). pp 517–531

2. Berdine J Chawdhary A Cook B Distefano D O’Hearn P (2007) Variance analyses from invariance analyses. In: Proceedings of ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL). pp 211–224

3. Babić D Cook B Hu AJ Rakamarić Z (2007) Proving termination by divergence. In: Proceedings of IEEE international conference on software engineering and formal methods (SEFM). pp 93–102

4. Bradley A Manna Z Sipma H (2005) Termination of polynomial programs. In: Proceedings of international conference on verification model checking and abstract interpretation (VMCAI). pp 113–129

5. Bradley AR Manna Z Sipma HB (2005) The polyranking principle. In: Proceedings of international colloquium on automata languages and programming (ICALP). pp 1349–1361

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

1. Polynomial interrupt timed automata: Verification and expressiveness;Information and Computation;2021-04

2. PBLInv: Postcondition-based Loop Invariant Learning for C Programs;2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS);2020-12

3. Termination of Polynomial Loops;Static Analysis;2020

4. Termination Analysis of Probabilistic Programs Through Positivstellensatz’s;Computer Aided Verification;2016

5. Termination of Two Variable Homogeneous Linear Loops;2013 Sixth International Conference on Business Intelligence and Financial Engineering;2013-11