Skip to main content
SpringerLink
Log in

In-Place vs. Copy-on-Write CEGAR Refinement for Block Summarization with Caching

  • Conference paper
  • First Online:
Leveraging Applications of Formal Methods, Verification and Validation. Verification (ISoLA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11245))

Included in the following conference series:

Abstract

Block summarization is an efficient technique in software verification to decompose a verification problem into separate tasks and to avoid repeated exploration of reusable parts of a program. In order to benefit from abstraction at the same time, block summarization can be combined with counterexample-guided abstraction refinement (CEGAR). This causes the following problem: whenever CEGAR instructs the model checker to refine the abstraction along a path, several block summaries are affected and need to be updated. There exist two different refinement strategies: a destructive in-place approach that modifies the existing block abstractions and a constructive copy-on-write approach that does not change existing data. While the in-place approach is used in the field for several years, our new approach of copy-on-write refinement has the following important advantage: A complete exportable proof of the program is available after the analysis has finished. Due to the benefit from avoiding recomputations of missing information as necessary for in-place updates, the new approach causes almost no computational overhead overall. We perform a large experimental evaluation to compare the new approach with the previous one to show that full proofs can be achieved without overhead.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://cpachecker.sosy-lab.org

  2. 2.

    https://www.sosy-lab.org/research/bam-cow-refinement

  3. 3.

    https://github.com/sosy-lab/sv-benchmarks

  4. 4.

    https://cpachecker.sosy-lab.org

References

  1. Andrianov, P., Friedberger, K., Mandrykin, M.U., Mutilin, V.S., Volkov, A.: CPABAM-BnB: Block-abstraction memoization and region-based memory models for predicate abstractions. In: Proc. TACAS. LNCS, vol. 10206, pp. 355–359. Springer (2017)

    Google Scholar 

  2. Andrianov, P., Mutilin, V.S., Mandrykin, M.U., Vasilyev, A.: CPA-BAM-Slicing: Block-abstraction memoization and slicing with region-based dependency analysis (competition contribution). In: Proc. TACAS. LNCS, vol. 10806, pp. 427–431. Springer (2018)

    Google Scholar 

  3. Ball, T., Rajamani, S.K.: Bebop: A symbolic model checker for boolean programs. In: Proc. SPIN. LNCS, vol. 1885, pp. 113–130. Springer (2000)

    Google Scholar 

  4. Ball, T., Rajamani, S.K.: The Slam project: Debugging system software via static analysis. In: Proc. POPL, pp. 1–3. ACM (2002)

    Google Scholar 

  5. Beyer, D.: Software verification with validation of results (Report on SV-COMP 2017). In: Proc. TACAS. LNCS, vol. 10206, pp. 331–349. Springer (2017)

    Google Scholar 

  6. Beyer, D., Dangl, M., Dietsch, D., Heizmann, M.: Correctness witnesses: Exchanging verification results between verifiers. In: Proc. FSE, pp. 326–337. ACM (2016)

    Google Scholar 

  7. Beyer, D., Friedberger, K.: Domain-independent multi-threaded software model checking. In: Proc. ASE, pp. 634–644. ACM (2018)

    Google Scholar 

  8. Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker Blast. Int. J. Softw. Tools Technol. Transfer 9(5–6), 505–525 (2007)

    Article  Google Scholar 

  9. Beyer, D., Henzinger, T.A., Théoduloz, G.: Program analysis with dynamic precision adjustment. In: Proc. ASE, pp. 29–38. IEEE (2008)

    Google Scholar 

  10. Beyer, D., Keremoglu, M.E.: CPAchecker: A tool for configurable software verification. In: Proc. CAV. LNCS, vol. 6806, pp. 184–190. Springer (2011)

    Google Scholar 

  11. Beyer, D., Keremoglu, M.E., Wendler, P.: Predicate abstraction with adjustable-block encoding. In: Proc. FMCAD, pp. 189–197. FMCAD (2010)

    Google Scholar 

  12. Beyer, D., Löwe, S.: Explicit-state software model checking based on CEGAR and interpolation. In: Proc. FASE. LNCS, vol. 7793, pp. 146–162. Springer (2013)

    Google Scholar 

  13. Beyer, D., Löwe, S., Wendler, P.: Refinement selection. In: Proc. SPIN. LNCS, vol. 9232, pp. 20–38. Springer (2015)

    Google Scholar 

  14. Chaki, S., Clarke, E.M., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. IEEE Trans. Softw. Eng. 30(6), 388–402 (2004)

    Article  Google Scholar 

  15. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752–794 (2003)

    Article  MathSciNet  Google Scholar 

  16. Clarke, E.M., Kröning, D., Sharygina, N., Yorav, K.: SatAbs: SAT-based predicate abstraction for ANSI-C. In: Proc. TACAS. LNCS, vol. 3440, pp. 570–574. Springer (2005)

    Google Scholar 

  17. Friedberger, K.: CPA-BAM: Block-abstraction memoization with value analysis and predicate analysis. In: Proc. TACAS. LNCS, vol. 9636, pp. 912–915. Springer (2016)

    Google Scholar 

  18. Henzinger, T.A., Jhala, R., Majumdar, R.: Race checking by context inference. In: Proc. PLDI, pp. 1–13. ACM (2004)

    Google Scholar 

  19. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proc. POPL, pp. 58–70. ACM (2002)

    Google Scholar 

  20. Hoare, C.A.R.: Procedures and parameters: An axiomatic approach. In: Symposium on Semantics of Algorithmic Languages, pp. 102–116. Springer (1971)

    Google Scholar 

  21. Holzmann, G.J., Joshi, R., Groce, A.: Tackling large verification problems with the Swarm tool. In: Proc. SPIN 2008. LNCS, vol. 5156, pp. 134–143. Springer (2008)

    Google Scholar 

  22. McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119–161 (2011)

    Article  Google Scholar 

  23. McMillan, K.L.: Lazy abstraction with interpolants. In: Proc. CAV. LNCS, vol. 4144, pp. 123–136. Springer (2006)

    Google Scholar 

  24. Reps, T.W.: Program analysis via graph reachability. In: Proc. ILPS, pp. 5–19. MIT (1997)

    Google Scholar 

  25. Sery, O., Fedyukovich, G., Sharygina, N.: Funfrog: Bounded model checking with interpolation-based function summarization. In: Proc. ATVA. LNCS, vol. 7561, pp. 203–207. Springer (2012)

    Google Scholar 

  26. Sery, O., Fedyukovich, G., Sharygina, N.: Interpolation-based function summaries in bounded model checking. In: Proc. HVC. LNCS, vol. 7261, pp. 160–175. Springer (2012)

    Google Scholar 

  27. Wonisch, D., Wehrheim, H.: Predicate analysis with block-abstraction memoization. In: Proc. ICFEM. LNCS, vol. 7635, pp. 332–347. Springer (2012)

    Google Scholar 

  28. Xie, Y., Aiken, A.: Saturn: A scalable framework for error detection using boolean satisfiability. TOPLAS 29(3), 16 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LMU Munich, Munich, Germany

    Dirk Beyer & Karlheinz Friedberger

Authors
  1. Dirk Beyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karlheinz Friedberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Limerick, Limerick, Ireland

    Tiziana Margaria

  2. TU Dortmund, Dortmund, Germany

    Bernhard Steffen

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Beyer, D., Friedberger, K. (2018). In-Place vs. Copy-on-Write CEGAR Refinement for Block Summarization with Caching. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Verification. ISoLA 2018. Lecture Notes in Computer Science(), vol 11245. Springer, Cham. https://doi.org/10.1007/978-3-030-03421-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03421-4_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03420-7

  • Online ISBN: 978-3-030-03421-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation