A Maximum Weight Heuristic Method for Abstract State Computation
暂无分享,去创建一个
Li Li | Jianmin Wang | Xiaoyu Song | Ming Gu
[1] Edmund M. Clarke,et al. Counterexample-Guided Abstraction Refinement , 2000, CAV.
[2] Joseph Sifakis,et al. A Unified Approach for Studying the Properties of Transition Systems , 1982, Theor. Comput. Sci..
[3] Andreas Podelski,et al. Boolean and Cartesian abstraction for model checking C programs , 2001, International Journal on Software Tools for Technology Transfer.
[4] Thomas A. Henzinger,et al. The Blast Query Language for Software Verification , 2004, SAS.
[5] Helmut Veith,et al. Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.
[6] Thomas A. Henzinger,et al. Lazy abstraction , 2002, POPL '02.
[7] David S. Rosenblum. A Practical Approach to Programming With Assertions , 1995, IEEE Trans. Software Eng..
[8] Hassen Saïdi,et al. Construction of Abstract State Graphs with PVS , 1997, CAV.
[9] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[10] Kenneth L. McMillan,et al. An interpolating theorem prover , 2005, Theor. Comput. Sci..
[11] Joseph Sifakis,et al. Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..
[12] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.