Refining abstract interpretations
暂无分享,去创建一个
[1] François Bourdoncle,et al. Efficient chaotic iteration strategies with widenings , 1993, Formal Methods in Programming and Their Applications.
[2] Zohar Manna,et al. Automatic Generation of Invariants and Assertions , 1995, CP.
[3] Supratik Chakraborty,et al. Automatically Refining Abstract Interpretations , 2008, TACAS.
[4] Sriram K. Rajamani,et al. Counterexample Driven Refinement for Abstract Interpretation , 2006, TACAS.
[5] Roberto Bagnara,et al. Widening Operators for Powerset Domains , 2004, VMCAI.
[6] Andreas Podelski,et al. ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement , 2007, PADL.
[7] Thomas A. Henzinger,et al. Lazy abstraction , 2002, POPL '02.
[8] Sriram K. Rajamani,et al. The SLAM project: debugging system software via static analysis , 2002, POPL '02.
[9] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[10] William Craig,et al. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory , 1957, Journal of Symbolic Logic.