Article

Termination analysis with algorithmic learning

Authors:

Kwangkeun YiAuthors Info & Claims

CAV'12: Proceedings of the 24th international conference on Computer Aided Verification

Pages 88 - 104

https://doi.org/10.1007/978-3-642-31424-7_12

Published: 07 July 2012 Publication History

Abstract

An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedures to compute transition invariants as proofs of program termination. Compared to the previous approaches that mostly aim to find a particular form of transition invariants, our technique does not commit to any particular one. For the examples that the previous approaches simply give up and report failure our technique can still prove the termination. We compare our technique with others on several benchmarks from literature including PolyRank examples, SNU realtime benchmark, and Windows device driver examples. The result shows that our technique outperforms others both in efficiency and effectiveness.

References

[1]

Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S.K., Ustuner, A.: Thorough static analysis of device drivers. In: EuroSys (2006).

Digital Library

[2]

Berdine, J., Chawdhary, A., Cook, B., Distefano, D., O'Hearn, P.: Variance analyses from invariance analyses. In: POPL (2007).

Digital Library

[3]

Berdine, J., Cook, B., Distefano, D., O'Hearn, P.W.: Automatic Termination Proofs for Programs with Shape-Shifting Heaps. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 386-400. Springer, Heidelberg (2006).

Digital Library

[4]

Bradley, A.R., Manna, Z., Sipma, H.B.: Linear Ranking with Reachability. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 491-504. Springer, Heidelberg (2005).

Digital Library

[5]

Bradley, A.R., Manna, Z., Sipma, H.B.: The Polyranking Principle. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1349-1361. Springer, Heidelberg (2005).

Digital Library

[6]

Bradley, A.R., Manna, Z., Sipma, H.B.: Termination of Polynomial Programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 113-129. Springer, Heidelberg (2005).

Digital Library

[7]

Bshouty, N.H.: Exact learning Boolean function via the monotone theory. Information and Computation 123(1), 146-153 (1995).

Digital Library

[8]

Chawdhary, A., Cook, B., Gulwani, S., Sagiv, M., Yang, H.: Ranking Abstractions. In: Gairing, M. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 148-162. Springer, Heidelberg (2008).

Digital Library

[9]

Chen, Y.F., Wang, B.Y.: Learning Boolean Functions Incrementally. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 55-70. Springer, Heidelberg (2012).

Digital Library

[10]

Cook, B., Gulwani, S., Lev-Ami, T., Rybalchenko, A., Sagiv, M.: Proving Conditional Termination. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 328-340. Springer, Heidelberg (2008).

Digital Library

[11]

Cook, B., Kroening, D., Rümmer, P., Wintersteiger, C.M.: Ranking Function Synthesis for Bit-Vector Relations. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 236-250. Springer, Heidelberg (2010).

Digital Library

[12]

Cook, B., Podelski, A., Rybalchenko, A.: Abstraction Refinement for Termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 87-101. Springer, Heidelberg (2005).

Digital Library

[13]

Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: PLDI (2006).

Digital Library

[14]

Cook, B., Podelski, A., Rybalchenko, A.: Proving thread termination. In: PLDI (2007).

Digital Library

[15]

Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977).

Digital Library

[16]

de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008).

Digital Library

[17]

Harris, W.R., Lal, A., Nori, A.V., Rajamani, S.K.: Alternation for Termination. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 304-319. Springer, Heidelberg (2010).

Digital Library

[18]

Heizmann, M., Jones, N.D., Podelski, A.: Size-Change Termination and Transition Invariants. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 22-50. Springer, Heidelberg (2010).

Digital Library

[19]

Jung, Y., Kong, S., Wang, B.-Y., Yi, K.: Deriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 180-196. Springer, Heidelberg (2010).

Digital Library

[20]

Jung, Y., Lee, W., Wang, B.-Y., Yi, K.: Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 205-219. Springer, Heidelberg (2011).

Digital Library

[21]

Kong, S., Jung, Y., David, C., Wang, B.-Y., Yi, K.: Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol. 6461, pp. 328-343. Springer, Heidelberg (2010).

Digital Library

[22]

Kroening, D., Sharygina, N., Tsitovich, A.,Wintersteiger, C.M.: Termination Analysis with Compositional Transition Invariants. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 89-103. Springer, Heidelberg (2010).

Digital Library

[23]

Miné, A.: The octagon abstract domain. Higher-Order and Symbolic Computation 19(1), 31-100 (2006).

Digital Library

[24]

Podelski, A., Rybalchenko, A.: A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239-251. Springer, Heidelberg (2004).

[25]

Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS (2004).

Digital Library

[26]

Podelski, A., Rybalchenko, A.: Transition predicate abstraction and fair termination. In: POPL (2005).

Digital Library

[27]

Tsitovich, A., Sharygina, N., Wintersteiger, C.M., Kroening, D.: Loop Summarization and Termination Analysis. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 81-95. Springer, Heidelberg (2011).

Digital Library

Cited By

Alon YDavid CRoychoudhury ACadar CKim M(2022)Using graph neural networks for program terminationProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3549095(910-921)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3549095
Abate AGiacobbe MRoy D(2021)Learning Probabilistic Termination ProofsComputer Aided Verification10.1007/978-3-030-81688-9_1(3-26)Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-81688-9_1
Chen YHeizmann MLengál OLi YTsai MTurrini AZhang L(2018)Advanced automata-based algorithms for program termination checkingACM SIGPLAN Notices10.1145/3296979.319240553:4(135-150)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192405
Show More Cited By

Recommendations

Termination of non-simple rewrite systems
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in ...
From Outermost Termination to Innermost Termination
SOFSEM '09: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important technique for program verification. To capture the evaluation mechanism of a programming ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CAV'12: Proceedings of the 24th international conference on Computer Aided Verification

July 2012

789 pages

ISBN:9783642314230

Editors:
P. Madhusudan
Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
,
Sanjit A. Seshia
Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA

Sponsors

NEC Labs: NEC Labs
IBMR: IBM Research
Intel: Intel
Microsoft Research: Microsoft Research

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 July 2012

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Alon YDavid CRoychoudhury ACadar CKim M(2022)Using graph neural networks for program terminationProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3549095(910-921)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3549095
Abate AGiacobbe MRoy D(2021)Learning Probabilistic Termination ProofsComputer Aided Verification10.1007/978-3-030-81688-9_1(3-26)Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-81688-9_1
Chen YHeizmann MLengál OLi YTsai MTurrini AZhang L(2018)Advanced automata-based algorithms for program termination checkingACM SIGPLAN Notices10.1145/3296979.319240553:4(135-150)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192405
Chen YHeizmann MLengál OLi YTsai MTurrini AZhang LFoster JGrossman D(2018)Advanced automata-based algorithms for program termination checkingProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192405(135-150)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192405
Padon OHoenicke JLosa GPodelski ASagiv MShoham S(2017)Reducing liveness to safety in first-order logicProceedings of the ACM on Programming Languages10.1145/31581142:POPL(1-33)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158114
Chen HDavid CKroening DSchrammel PWachter B(2017)Bit-Precise Procedure-Modular Termination AnalysisACM Transactions on Programming Languages and Systems10.1145/312113640:1(1-38)Online publication date: 10-Dec-2017
https://dl.acm.org/doi/10.1145/3121136
Farzan AKincaid ZPodelski AKoskinen EGrohe MShankar N(2016)Proving Liveness of Parameterized ProgramsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2935310(185-196)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2935310
Chen HDavid CKroening DSchrammel PWachter BCohen MGrunske LWhalen M(2015)Synthesising interprocedural bit-precise termination proofsProceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering10.1109/ASE.2015.10(53-64)Online publication date: 9-Nov-2015
https://dl.acm.org/doi/10.1109/ASE.2015.10
Heizmann MHoenicke JPodelski A(2014)Termination Analysis by Learning Terminating ProgramsProceedings of the 16th International Conference on Computer Aided Verification - Volume 855910.1007/978-3-319-08867-9_53(797-813)Online publication date: 18-Jul-2014
https://dl.acm.org/doi/10.1007/978-3-319-08867-9_53
Nori ASharma RMeyer BBaresi LMezini M(2013)Termination proofs from testsProceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering10.1145/2491411.2491413(246-256)Online publication date: 18-Aug-2013
https://dl.acm.org/doi/10.1145/2491411.2491413
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten