期刊文献+

基于深度学习和反例制导的循环程序秩函数生成

Ranking Function Synthesis for Loop Programs via Counterexample Guided Deep Learning
下载PDF
导出
摘要 程序终止性判定是程序分析与验证领域中的一个研究热点.针对非线性循环程序,提出了一种基于反例制导的神经网络型秩函数的构造方法.该方法采用学习组件和验证组件交互的迭代框架,其中,学习组件利用程序轨迹作为训练集合构造一个候选秩函数;验证组件运用可满足性模理论(satisfiability modulo theories,SMT)确保候选秩函数的有效性;而由SMT返回的反例则进一步用于扩展学习组件中的训练集合,以对候选秩函数进行精化.实验结果表明,所提出的方法比已有的机器学习方法在秩函数的构造效率和构造能力上具有优势. This study proposes a novel approach for synthesizing ranking functions that are expressed as feed-forward neural networks.The approach employs a counter example-guided synthesis procedure,where a learner and a verifier interact to synthesize ranking function.The learner trains a candidate ranking function that satisfies the ranking function conditions over a set of sampled data,and the verifier either ensures the validity of the candidate ranking function or yields counterexamples,which are passed back to further guide the learner.The procedure leverages efficient supervised learning algorithm,while guaranteeing formal soundness via SMT solver.The tool SyntheRF is implemented,then,its scalability and effectiveness are evaluated over a set of benchmark examples.
作者 林开鹏 梅国泉 林望 丁佐华 LIN Kai-Peng;MEI Guo-Quan;LIN Wang;DING Zuo-Hua(School of Information Science and Technology,Zhejiang Sci-Tech University,Hangzhou 310018,China)
出处 《软件学报》 EI CSCD 北大核心 2022年第8期2918-2929,共12页 Journal of Software
基金 浙江省自然科学基金(LY20F020020) 上海工业控制系统安全创新功能型平台开放课题 上海工业控制安全创新科技有限公司资助课题。
关键词 秩函数 反例制导方法 深度神经网络 终止性分析 循环程序 ranking function counterexample guided procedure deep neural networks termination analysis loop programs
  • 相关文献

参考文献1

二级参考文献21

  • 1Turing A, On computable numbers, with an application to the entscheidungsproblem, Proc. of the London Mathematical Society, 1937, $2-42(1): 230-265.
  • 2Tiwari A, Termination of linear programs, Computer Aided Verification (ed. by Alur R and Peled D), Springer-Verlag, Lecture Notes in Computer Science, 2004, 3114: 70-82.
  • 3Braverman M, Termination of integer linear programs, Computer Aided Verification (ed. by Ball T and Jones R B), Springer-Verlag, Lecture Notes in Computer Science, 2006 4144: 372-385.
  • 4Bradley A R, Manna Z, and Sipma H B, Termination of polynomial programs, Verification, Model Checking, and Abstract Interpretation (ed. by Cousot R), Springer, Lecture Notes in Computer Science, 2005, 3385:113 129.
  • 5Babic D, Hu A J, Rakamaric Z, and Cook engineering and formal methods, IEEE, 2007, B, Proving termination by divergence: Software 93-102.
  • 6ColSn M and Sipma H B, Synthesis of linear ranking functions, Tools and Algorithms for the Construction and Analysis of Systems (ed. by Margaria T and Yi W), Springer-Verlag, Lecture Notes in Computer Science, 2001, 2031: 67-81.
  • 7Col6n M and Sipma H B, Practical methods for proving program termination, Computer Aided Verification (ed. by Brinksma E and Larsen K G), Springer-Verlag, Lecture Notes in Computer Science, 2002, 2404: 442-454.
  • 8Podelski A and Rybalchenko A, A complete method for the synthesis of linear ranking functions, Verification, Model Checking, and Abstract Interpretation (ed. by Steffen B and Levi G), Springer, Lecture Notes in Computer Science, 2004, 2937:239- 251.
  • 9Bradley A R, Manna Z, and Sipma H B, Termination analysis of integer linear loops, Concurrency Theory, 16th International Conference, Springer-Verlag, Lecture Notes in Computer Science, 2005, 3653: 488-502.
  • 10Chen Y, Xia B, Yang L, Zhan N, and Zhou C, Discovering non-linear ranking functions by solving semi-algebraic systems, Theoretical Aspects of Computing, Springer-Verlag, Lecture Notes in Computer Science, 2007, 4711: 34-49.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部