Das M,S Lerner,M Seigle.ESP:Path-sensitive program verification in polynomial time[J].ACM Sigplan Notices,2002,37(5):57-68.
[3]
Engler D,Chelf B,Chou A,et al.Checking System Rules Using System-Specific,Programmer-Written Compiler Extensions[M].Berkeley:Usenix Assoc,2000.1-16.
[4]
Jagannathan,Suresh,et al.Single and loving it:must-alias analysis for higher-order languages[A].25th ACM Sigplan-Sigact Symposium on Principles of Programming Languages[C].USA:ACM,1998.329-341.
[5]
Altucher,Rita Z,William Landi.An extended form of must alias analysis for dynamic allocation[A].22nd ACM Sigplan-Sigact Symposium Principles of Programming Languages[C].USA:ACM,1995.74-84.
[6]
Jeannet B,Mine A.Apron:a library of numerical abstract domains for static analysis[A].Lecture Notes in Computer Science[C].Berlin:Springer-Verlag,2009.661-667.
[7]
Weise,Daniel,et al.Value dependence graphs:representation without taxation[A].21st ACM Sigplan-Sigact Symposium on Principles of Programming Languages[C].USA:ACM,1994.297-310.
[8]
Daniel Le Berre,Anne Parrain.SAT4J:a satisfiability library for java[OL].http://www.sat4j.org/,2011-01-01.
[9]
Radu Rugina,Maksim Orlovich,Xin Zheng.Crystal:a program analysis system for C[OL].http://www.cs.cornell.edu/projects/crystal,2006-11-01.
[10]
Moore R E,Kearfott R B,Cloud M J.Introduction to Interval Analysis[M].Siam,2009.
[11]
P？r Emanuelsson,Ulf Nilsson.A comparative study of industrial static analysis tools[A].Proceedings of the 3rd International Workshop on Systems Software Verification[C]. Australia,2008.5-21.
[12]
Xie Y C,Aiken A.Scalable error detection using boolean satisfiability[J].ACM Sigplan Notices,2005,40(1):351-363.
[13]
The MITRE Corporation.Common Weakness Enumeration[OL].http://cwe.mitre.org/,2014-07-31.
