期刊文献+

用Dixon结式产生非线性循环不变式 被引量:1

Non-linear Loop Invariant Generation Using Dxion Resultant
下载PDF
导出
摘要 针对循环程序的部分正确性问题,在代数变迁系统理论基础上,结合约束理论提出了一种用Dixon结式生成循环不变式的算法。首先,程序被转换成代数变迁系统,再根据代数变迁关系和不变式模板构造一个多项式组,计算此多项式组的Dixon结式可以得到关于模板变量的约束,最后对该约束系统求解就得到该模板形式的程序不变式。经实例分析,该算法应用于单路径和多路径程序均是有效的。 TO solve the partial correct problem of loop program, an algorithm was presented to generate non-linear loop invariant by computing Dixon resultant based on algebraic transition system and constraint system. The loop program was firstly transformed to an al- gebraic transition system, then a polynomial set was constructed from algebraic transition relation and invariant template, and a con- straint system w. r. t template variable was obtained by computing Dixon resultant. Finally the constraint system was resolved to get in- variant. The algorithm was effective to whether single-path or multi-path programs through case study.
作者 余伟 冯勇
出处 《四川大学学报(工程科学版)》 EI CAS CSCD 北大核心 2012年第4期115-121,共7页 Journal of Sichuan University (Engineering Science Edition)
基金 国家"973"计划资助项目(2011CB302402) 国家自然科学基金面上项目(11171053) 国家自然科学基金重大研究计划资助项目(91118001)
关键词 循环不变式 Dixon结式 模板 约束 loop invariant Dixon resultant template constraints
  • 相关文献

参考文献21

  • 1Floyd R W. Assigning meanings to programs [ C ]//Proceed- ings of Symposia in Applied Mathematics. 1967:19 -37.
  • 2Dijkstra E W. A discipline of programming [ M ]. New lersey: Prentice Hall Inc, 1976.
  • 3Gries D. The science of programming [ M ]. New York: Springer-Verlag, 1981.
  • 4Hoare C A R. An axiomatic basis for computer programming [ J ]. Communications of ACM, 1969,12 (10) :576 - 580.
  • 5Mine A. The octagon abstract domain [ J ]. Higher-Order and Symbolic Computation,2006,19 ( 1 ) :31 - 100.
  • 6Cousot P, Halbwachs N. Automatic discovery of linear re- straints among variables of a program [ C ]. POPL, 1978: 84 - 96.
  • 7Coust P, Coust R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or ap- proximation of fixpoints [ C ]//ACM Principles of Program- ming Languages. New York : ACM Press, 1977:238 - 252.
  • 8Cousot P, Halbwachs N. Automatic discovery of linear re- straints among the variables of a program[ C ]//ACM Princi- ples of Programming Languages. New York: ACM Press, 1978 : 84 - 97.
  • 9Sankaranarayanan S, Sipma H B, Manna Z. Non-linear loop invariant generation using Grobner bases [ C ]//ACM SIGP- LAN Principles of Programming Languages. New York:ACM Press ,2004:318 - 329.
  • 10Colon M, Sankaranarayanan S, Sipma H. Linear invariant generation using non-linear constraint solving [ C ]//CAV 2003: Computer-Aided Verification, LNCS 2725. Heidel- berg: Springer Verleg,2003:420 - 433.

同被引文献5

  • 1Lu Yang,Chaochen Zhou,Naijun Zhan,Bican Xia.Recent advances in program verification through computer algebra[J].Frontiers of Computer Science in China.2010(1)
  • 2E. Rodríguez-Carbonell,D. Kapur.Generating all polynomial invariants in simple loops[J].Journal of Symbolic Computation.2007(4)
  • 3Markus Müller-Olm,Helmut Seidl.Computing polynomial program invariants[J].Information Processing Letters.2004(5)
  • 4C. A. R. Hoare.An axiomatic basis for computer programming[J].Communications of the ACM.1969(10)
  • 5周宁,吴尽昭,王超.基于吴方法的不变式生成算法[J].北京交通大学学报,2012,36(2):1-7. 被引量:6

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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