Improving Static Analyses of C Programs with Conditional Predicates
暂无分享,去创建一个
[1] Hassen Saïdi,et al. Verifying Invariants Using theorem Proving , 1996, CAV.
[2] Flemming Nielson,et al. Principles of Program Analysis , 1999, Springer Berlin Heidelberg.
[3] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[4] Rupak Majumdar,et al. Joining dataflow with predicates , 2005, ESEC/FSE-13.
[5] Patrick Cousot,et al. Abstract Interpretation Frameworks , 1992, J. Log. Comput..
[6] François Bourdoncle,et al. Efficient chaotic iteration strategies with widenings , 1993, Formal Methods in Programming and Their Applications.
[7] Antoine Miné,et al. Symbolic Methods to Enhance the Precision of Numerical Abstract Domains , 2006, VMCAI.
[8] Xavier Rival,et al. The trace partitioning abstract domain , 2007, TOPL.
[9] Julien Signoles,et al. Combining Analyses for C Program Verification , 2012, FMICS.
[10] Nikolai Kosmatov,et al. Behind the scenes in SANTE: a combination of static and dynamic analyses , 2013, Automated Software Engineering.
[11] Patrick Cousot,et al. Combination of Abstractions in the ASTRÉE Static Analyzer , 2006, ASIAN.
[12] Nikolai Kosmatov,et al. Frama-C - A Software Analysis Perspective , 2012, SEFM.