Author:
Lin Wang,Wu Min,Yang Zhengfeng,Zeng Zhenbing
Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,Theoretical Computer Science
Reference43 articles.
1. McIver A K, Morgan C. Partial correctness for probabilistic demonic programs. Theoretical Computer Science, 2001, 266(1–2): 513–541
2. Kovacs L. Automated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema. PhD thesis, Johannes Kepler University Linz, Austria, 2007
3. Logozzo F. Automatic inference of class invariants. In: Proceedings of the 5th International Conference on Verification, Model Checking, and Abstract Interpretation. 2004, 2937: 211–222
4. Rodríguez-Carbonell E, Kapur D. Automatic generation of polynomial loop invariants for imperative programs. URL: www.cs.unm.edu/moore/tr/03-10/invpaper3.pdf , 2003
5. Chen Y, Xia B, Yang L, Zhan N. Generating polynomial invariants with DISCOVERER and QEPCAD. Formal Methods and Hybrid Real-Time Systems, 2007, 67–82
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scalable linear invariant generation with Farkas’ lemma;Proceedings of the ACM on Programming Languages;2022-10-31
2. Polynomial invariant generation for non-deterministic recursive programs;Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation;2020-06-06
3. Sharper and Simpler Nonlinear Interpolants for Program Verification;Programming Languages and Systems;2017