Program Verification by Reduction to Semi-algebraic Systems Solving | |
Xia, Bican ; Yang, Lu ; Zhan, Naijun | |
2008 | |
英文摘要 | The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we investigated invariant generation and non-linear ranking function discovering of polynomial programs by reduction to semi-algebraic systems solving. In this paper we will first summarize our results on the two topics and then show how to generalize the approach to discovering more expressive invariants and ranking functions, and applying to more general programs. ? Springer-Verlag Berlin Heidelberg 2008.; EI; CPCI-S(ISTP); 0 |
语种 | 英语 |
出处 | EI |
内容类型 | 其他 |
源URL | [http://hdl.handle.net/20.500.11897/315534] ![]() |
专题 | 数学科学学院 |
推荐引用方式 GB/T 7714 | Xia, Bican,Yang, Lu,Zhan, Naijun. Program Verification by Reduction to Semi-algebraic Systems Solving. 2008-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论