Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Automated Technology for Verification and Analysis

ATVA 2015: Automated Technology for Verification and Analysis pp 344–360Cite as

PBMC: Symbolic Slicing for the Verification of Concurrent Programs

  • Conference paper
  • First Online:

  • 941 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9364))

Abstract

This paper proposes a novel optimization of bounded model checking (BMC) for better run-time efficiency. Specifically, we define projections, an adaptation of dynamic program slices, and instruct the bounded model checker to check projections only. Given state properties over a subset of the program’s variables, we prove the soundness of the proposed optimization.

We propose a symbolic encoding of projections and implement it for a prototype language of concurrent programs. We have developed a tool called PBMC to evaluate the efficiency of the proposed approach. Our evaluation with various concurrent programs justifies the potential of projections to efficient verification.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Notes

  1. 1.

    Ignoring our assumption about the initial values of the variables.

  2. 2.

    For simplicity we focus on deterministic systems, although our results equally hold for non-deterministic programs.

  3. 3.

    More precisely, the solver will assign a value to \(sel^i\) which does not correspond to any of the instructions.

References

  1. ESBMC. http://www.esbmc.org/. Accessed 4 October 2015

  2. LLBMC. http://llbmc.org/. Accessed 4 October 2015

  3. Z3. http://z3.codeplex.com/. Accessed 4 October2015

  4. Abdulla, P., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction. In: POPL, pp. 373–384. ACM Press (2014)

    Google Scholar 

  5. Agrawal, H., Horgan, J.R.: Dynamic program slicing. In: PLDI, pp. 246–256. ACM Press (1990)

    Google Scholar 

  6. Alglave, J., Kroening, D., Tautschnig, M.: Partial orders for efficient bounded model checking of concurrent software. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 141–157. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  8. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Bokor, P., Kinder, J., Serafini, M., Suri, N.: Supporting domain-specific state space reductions through local partial-order reduction. In: ASE, pp. 113–122. IEEE Press (2011)

    Google Scholar 

  10. Burckhardt, S., Alur, R., Martin, M.M.: Checkfence: checking consistency of concurrent data types on relaxed memory models. In: PLDI, pp. 12–21. ACM Press (2007)

    Google Scholar 

  11. Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Clarke, E., Kroning, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168–176. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  14. Dwyer, M.B., Hatcliff, J., Hoosier, M., Ranganath, V.P., Wallentine, T.: Evaluating the effectiveness of slicing for model reduction of concurrent object-oriented programs. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 73–89. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: POPL, pp. 110–121. ACM Press (2005)

    Google Scholar 

  16. Ganai, M., Gupta, A.: Tunneling and slicing: towards scalable BMC. In: DAC, pp. 137–142. IEEE Press (2008)

    Google Scholar 

  17. Godefroid, P., van Leeuwen, J., Hartmanis, J., Goos, G., Wolper, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996)

    Google Scholar 

  18. Gueta, G., Flanagan, C., Yahav, E., Sagiv, M.: Cartesian partial-order reduction. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 95–112. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Jhala, R., Majumdar, R.: Path slicing. In: PLDI, pp. 38–47. ACM Press (2005)

    Google Scholar 

  20. Kahlon, V., Wang, C., Gupta, A.: Monotonic partial order reduction: an optimal symbolic partial order reduction technique. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 398–413. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Krinke, J.: Advanced slicing of sequential and concurrent programs. In: International Conference on Software Maintenance, pp. 464–468. IEEE Press (2004)

    Google Scholar 

  22. Lal, A., Qadeer, S., Lahiri, S.K.: A solver for reachability modulo theories. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 427–443. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  23. Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986. LNCS, vol. 255, pp. 278–324. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  24. McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 123–136. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Păsăreanu, C.S., Visser, W., Bushnell, D., Geldenhuys, J., Mehlitz, P., Rungta, N.: Symbolic pathfinder: integrating symbolic execution with model checking for java bytecode analysis. Autom. Softw. Eng. 20(3), 391–425 (2013)

    Article  Google Scholar 

  26. Ranganath, V.P., Hatcliff, J.: Slicing concurrent java programs using Indus and Kaveri. Int. J. Softw. Tools Technol. Transfer 9(5–6), 489–504 (2007)

    Article  Google Scholar 

  27. Sinha, N., Wang, C.: On interference abstractions. In: POPL, pp. 423–434. ACM Press (2011)

    Google Scholar 

  28. Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  29. Wachter, B., Kroening, D., Ouaknine, J.: Verifying multi-threaded software with Impact. In: FMCAD, pp. 210–217. IEEE Press (2013)

    Google Scholar 

  30. Weiser, M.: Program slicing. In: ICSE, pp. 439–449. IEEE Press (1981)

    Google Scholar 

Download references

Acknowledgment

Research supported by TUD Cased & EC-SPRIDE.

Author information

Authors and Affiliations

  1. Technische Univeristät Darmstadt, Darmstadt, Germany

    Habib Saissi, Péter Bokor & Neeraj Suri

Authors
  1. Habib Saissi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Péter Bokor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neeraj Suri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Habib Saissi .

Editor information

Editors and Affiliations

  1. Universität des Saarlandes, Saarbrücken, Germany

    Bernd Finkbeiner

  2. East China Normal University, Shanghai, China

    Geguang Pu

  3. Chinese Academy of Sciences, Beijing, China

    Lijun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Saissi, H., Bokor, P., Suri, N. (2015). PBMC: Symbolic Slicing for the Verification of Concurrent Programs. In: Finkbeiner, B., Pu, G., Zhang, L. (eds) Automated Technology for Verification and Analysis. ATVA 2015. Lecture Notes in Computer Science(), vol 9364. Springer, Cham. https://doi.org/10.1007/978-3-319-24953-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24953-7_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24952-0

  • Online ISBN: 978-3-319-24953-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation