Advertisement

CPA-BAM-BnB: Block-Abstraction Memoization and Region-Based Memory Models for Predicate Abstractions

(Competition Contribution)
  • Pavel Andrianov
  • Karlheinz Friedberger
  • Mikhail Mandrykin
  • Vadim Mutilin
  • Anton Volkov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10206)

Abstract

Our submission to SV-COMP’17 is based on the software verification framework CPAchecker. Combined with value analysis and predicate analysis we use the concept of block-abstraction memoization with optimization and several fixes relative to the version of SV-COMP’16. A novelty of our approach is usage of BnB memory model for predicate analysis, which efficiently divides the accessed memory into memory regions and thus leads to smaller formulas.

References

  1. 1.
    Beyer, D., Henzinger, T.A., Théoduloz, G.: Configurable software verification: concretizing the convergence of model checking and program analysis. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 504–518. Springer, Heidelberg (2007). doi: 10.1007/978-3-540-73368-3_51 CrossRefGoogle Scholar
  2. 2.
    Karpenkov, E.G., Friedberger, K., Beyer, D.: JavaSMT: a unified interface for SMT solvers in java. In: Blazy, S., Chechik, M. (eds.) VSTTE 2016. LNCS, vol. 9971, pp. 139–148. Springer, Heidelberg (2016). doi: 10.1007/978-3-319-48869-1_11 CrossRefGoogle Scholar
  3. 3.
    Wonisch, D., Wehrheim, H.: Predicate analysis with block-abstraction memoization. In: Aoki, T., Taguchi, K. (eds.) ICFEM 2012. LNCS, vol. 7635, pp. 332–347. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-34281-3_24 CrossRefGoogle Scholar
  4. 4.
    Friedberger, K.: CPA-BAM: block-abstraction memoization with value analysis and predicate analysis. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 912–915. Springer, Heidelberg (2016). doi: 10.1007/978-3-662-49674-9_58 CrossRefGoogle Scholar
  5. 5.
    Bornat, R.: Proving pointer programs in Hoare logic. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 102–126. Springer, Heidelberg (2000). doi: 10.1007/10722010_8 CrossRefGoogle Scholar
  6. 6.
    Burstall, R.M.: Some techniques for proving correctness of programs which alter data structures. Mach. Intell. 7, 23–50 (1972)zbMATHGoogle Scholar
  7. 7.
    Löwe, S., Mandrykin, M., Wendler, P.: CPAchecker with sequential combination of explicit-value analyses and predicate analyses. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 392–394. Springer, Heidelberg (2014). doi: 10.1007/978-3-642-54862-8_27 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Pavel Andrianov
    • 1
  • Karlheinz Friedberger
    • 2
  • Mikhail Mandrykin
    • 1
  • Vadim Mutilin
    • 1
  • Anton Volkov
    • 1
  1. 1.Institute for System Programming of the Russian Academy of SciencesMoscowRussia
  2. 2.University of PassauPassauGermany

Personalised recommendations