CPAchecker with Sequential Combination of Explicit-Value Analyses and Predicate Analyses
CPAchecker is a framework for software verification, built on the foundations of Configurable Program Analysis (CPA). For the SV-COMP’14, we file a CPAchecker configuration that runs up to five analyses in sequence. The first two analyses of our approach utilize the explicit-value domain for modeling the state space, while the remaining analyses are based on predicate abstraction. In addition to that, a bit-precise counterexample checker comes into action whenever an analysis finds a counterexample. The combination of conceptually different analyses is key to the success of our verification approach, as the diversity of verification tasks is taken into account.
KeywordsModel Check Program Counter Sequential Combination Reachability Problem Bounded Model Checker
- 1.Beyer, D., Henzinger, T.A., Keremoglu, M.E., Wendler, P.: Conditional model checking: A technique to pass information between verifiers. In: Tracz, W., Robillard, M.P., Bultan, T. (eds.) Proc. FSE, p. 57. ACM (2012)Google Scholar
- 2.Beyer, D., Keremoglu, M.E., Wendler, P.: Predicate abstraction with adjustable-block encoding. In: Bloem, R., Sharygina, N. (eds.) Proc. FMCAD, pp. 189–197. IEEE (2010)Google Scholar