skip to main content

CUBA: interprocedural Context-UnBounded Analysis of concurrent programs

Published:11 June 2018Publication History
Skip Abstract Section

Abstract

A classical result by Ramalingam about synchronization-sensitive interprocedural program analysis implies that reachability for concurrent threads running recursive procedures is undecidable. A technique proposed by Qadeer and Rehof, to bound the number of context switches allowed between the threads, leads to an incomplete solution that is, however, believed to catch “most bugs” in practice. The question whether the technique can also prove the absence of bugs at least in some cases has remained largely open.

In this paper we introduce a broad verification methodology for resource-parameterized programs that observes how changes to the resource parameter affect the behavior of the program. Applied to the context-unbounded analysis problem (CUBA), the methodology results in partial verification techniques for procedural concurrent programs. Our solutions may not terminate, but are able to both refute and prove context-unbounded safety for concurrent recursive threads. We demonstrate the effectiveness of our method using a variety of examples, the safe of which cannot be proved safe by earlier, context-bounded methods.

Skip Supplemental Material Section

Supplemental Material

p105-liu.webm

References

  1. Parosh Abdulla, Frédéric Haziza, and Lukáš Holík. 2016. Parameterized Verification Through View Abstraction. Int. J. Softw. Tools Technol. Transf. 18, 5 (Oct. 2016), 495–516. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Mohamed Faouzi Atig, Benedikt Bollig, and Peter Habermehl. 2008. Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. In Proceedings of the 12th International Conference on Developments in Language Theory (DLT’08). Springer-Verlag, Berlin, Heidelberg, 121–133. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Mohamed Faouzi Atig, Ahmed Bouajjani, and Shaz Qadeer. 2009. Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads. In Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’09). Springer-Verlag, Berlin, Heidelberg, 107–123. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Jesse D. Bingham. 2005. A New Approach to Upward-Closed Set Backward Reachability Analysis. Electr. Notes Theor. Comput. Sci. 138, 3 (2005), 37–48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Benedikt Bollig, Dietrich Kuske, and Roy Mennicke. 2017. The Complexity of Model Checking Multi-Stack Systems. Theor. Comp. Sys. 60, 4 (May 2017), 695–736. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Ahmed Bouajjani, Michael Emmi, and Gennaro Parlato. 2011. On Sequentializing Concurrent Programs. In Proceedings of the 18th International Conference on Static Analysis (SAS’11). Springer-Verlag, Berlin, Heidelberg, 129–145. http://dl.acm.org/citation.cfm?id=2041552. 2041565 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Ahmed Bouajjani, Javier Esparza, and Oded Maler. 1997. Reachability Analysis of Pushdown Automata: Application to Model-Checking. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR’97). Springer-Verlag, London, UK, 135–150. http://dl.acm. org/citation.cfm?id=646732.701281 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, and Jan Strejček. 2005. Reachability Analysis of Multithreaded Software with Asynchronous Communication. In Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’05). Springer-Verlag, Berlin, Heidelberg, 348–359. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ahmed Bouajjani, Séverine Fratani, and Shaz Qadeer. 2007. Contextbounded Analysis of Multithreaded Programs with Dynamic Linked Structures. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV’07). Springer-Verlag, Berlin, Heidelberg, 207–220. http://dl.acm.org/citation.cfm?id=1770351.1770383 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Ahmed Bouajjani, Markus Müller-Olm, and Tayssir Touili. 2005. Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR’05). Springer-Verlag, London, UK, 473–487. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Luca Breveglieri, Alessandra Cherubini, Claudio Citrini, and Stefano Crespi Reghizzi. 1996. Multi-Pushdown Languages and Grammars. Int. J. Found. Comput. Sci. 07, 03 (1996), 253–291.Google ScholarGoogle ScholarCross RefCross Ref
  12. S. Chaki, E. Clarke, N. Kidd, T. Reps, and T. Touili. 2006. Verifying Concurrent Message-passing C Programs with Recursive Calls. In Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’06). SpringerVerlag, Berlin, Heidelberg, 334–349. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. E. Allen Emerson and Vineet Kahlon. 2000. Reducing Model Checking of the Many to the Few. In Proceedings of the 17th International Conference on Automated Deduction (CADE-17). Springer-Verlag, London, UK, 236–254. http://dl.acm.org/citation.cfm?id=648236.753642 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Michael Emmi, Shaz Qadeer, and Zvonimir Rakamarić. 2011. Delaybounded Scheduling. In Proceedings of the 38th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL’11). ACM, New York, NY, USA, 411–422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Alain Finkel, Bernard Willems, and Pierre Wolper. 1997. A Direct Symbolic Approach to Model Checking Pushdown Systems. Elec. Not. Theor. Comput. Sci. 9 (1997), 27–37.Google ScholarGoogle ScholarCross RefCross Ref
  16. Naghmeh Ghafari, Alan J. Hu, and Zvonimir Rakamarić. 2010. Contextbounded Translations for Concurrent Software: An Empirical Evaluation. In Proceedings of the 17th International SPIN Conference on Model Checking Software (SPIN’10). Springer-Verlag, Berlin, Heidelberg, 227– 244. http://dl.acm.org/citation.cfm?id=1928137.1928160 Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Vineet Kahlon and Aarti Gupta. 2007. On the Analysis of Interacting Pushdown Systems. In Proceedings of the 34th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL’07). ACM, New York, NY, USA, 303–314. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Vineet Kahlon, Franjo Ivančić, and Aarti Gupta. 2005. Reasoning About Threads Communicating via Locks. In Proceedings of the 17th International Conference on Computer Aided Verification (CAV’05). SpringerVerlag, Berlin, Heidelberg, 505–518. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Alexander Kaiser, Daniel Kroening, and Thomas Wahl. 2010. Dynamic Cutoff Detection in Parameterized Concurrent Programs. In Proceedings of the 22Nd International Conference on Computer Aided Verification (CAV’10). Springer-Verlag, Berlin, Heidelberg, 645–659. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Dénes König. 1927. Über eine Schlussweise aus dem Endlichen ins Unendliche (in German). Acta Sci. Math. (Szeged) 3(2-3) (1927), 121– 130.Google ScholarGoogle Scholar
  21. H. T. Kung and Philip L. Lehman. 1980. Concurrent Manipulation of Binary Search Trees. ACM Trans. Database Syst. 5, 3 (Sept. 1980), 354–382. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Salvatore La Torre, Parthasarathy Madhusudan, and Gennaro Parlato. 2007. A Robust Class of Context-Sensitive Languages. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS’07). IEEE Computer Society, Washington, DC, USA, 161–170. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. 2008. Context-bounded Analysis of Concurrent Queue Systems. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’08). SpringerVerlag, Berlin, Heidelberg, 299–314. http://dl.acm.org/citation.cfm? id=1792734.1792762 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. 2009. Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. In Proceedings of the 21st International Conference on Computer Aided Verification (CAV’09). Springer-Verlag, Berlin, Heidelberg, 477– 492. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. 2010. ModelChecking Parameterized Concurrent Programs Using Linear Interfaces. In Proceedings of the 22nd International Conference on Computer Aided Verification (CAV’10). Springer-Verlag, Berlin, Heidelberg, 629–644. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Salvatore La Torre and Margherita Napoli. 2011. Reachability of Multistack Pushdown Systems with Scope-bounded Matching Relations. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR’11). Springer-Verlag, Berlin, Heidelberg, 203–218. http://dl.acm.org/citation.cfm?id=2040235.2040253 Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Salvatore La Torre, Margherita Napoli, and Gennaro Parlato. 2016. Scope-Bounded Pushdown Languages. Int. J. Found. Comput. Sci. 27, 02 (2016), 215–233.Google ScholarGoogle ScholarCross RefCross Ref
  28. Salvatore La Torre, Madhusudan Parthasarathy, and Gennaro Parlato. 2009. Analyzing Recursive Programs Using a Fixed-point Calculus. In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’09). ACM, New York, NY, USA, 211–222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Akash Lal and Thomas Reps. 2009. Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. Form. Methods Syst. Des. 35, 1 (Aug. 2009), 73–97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Peizun Liu and Thomas Wahl. 2018. CUBA: Interprocedural ContextUnBounded Analysis of Concurrent Programs (Extended Manuscript). CoRR abs/1804.04766 (2018), 1–16. http://arxiv.org/abs/1804.04766Google ScholarGoogle Scholar
  31. Peizun Liu and Thomas Wahl. 2018. The Homepage of CUBA. (2018). Retrieved April, 2018 from http://www.ccs.neu.edu/home/lpzun/cuba/Google ScholarGoogle Scholar
  32. Shan Lu, Soyeon Park, Eunsoo Seo, and Yuanyuan Zhou. 2008. Learning from Mistakes: A Comprehensive Study on Real World Concurrency Bug Characteristics. In Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XIII). ACM, New York, NY, USA, 329–339. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, and Gennaro Parlato. 2015. Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches. In Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’15), Vol. 9035. Springer Berlin Heidelberg, Berlin, Heidelberg, 461–463. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, and Gennaro Parlato. 2016. Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs. In Proceedings of the 14th International Symposium on Automated Technology for Verification and Analysis (ATVA’16). Springer International Publishing, Cham, 174–191.Google ScholarGoogle ScholarCross RefCross Ref
  35. Prathmesh Prabhu, Thomas Reps, Akash Lal, and Nicholas Kidd. 2011. Verifying Concurrent Programs via Bounded Context-Switching and Induction. Technical Report TR-1701. Computer Sciences Department, University of Wisconsin, Madison, WI, USA.Google ScholarGoogle Scholar
  36. Shaz Qadeer, Sriram K. Rajamani, and Jakob Rehof. 2004. Summarizing Procedures in Concurrent Programs. In Proceedings of the 31st ACM SIGPLAN Symposium on Principles of Programming Languages (POPL’04). ACM, New York, NY, USA, 245–255. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Shaz Qadeer and Jakob Rehof. 2005. Context-Bounded Model Checking of Concurrent Software. In Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’05). Springer-Verlag, Berlin, Heidelberg, 93–107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Shaz Qadeer and Dinghao Wu. 2004. KISS: Keep It Simple and Sequential. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’04). ACM, New York, NY, USA, 14–24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. G. Ramalingam. 2000. Context-sensitive Synchronization-sensitive Analysis is Undecidable. ACM Trans. Program. Lang. Syst. 22, 2 (March 2000), 416–430. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Stefan Schwoon. 2000. Model-Checking Pushdown Systems. Ph.D. Dissertation. Lehrstuhl für Informatik VII der Technischen Universität München.Google ScholarGoogle Scholar
  41. Dejvuth Suwimonteerabuth, Javier Esparza, and Stefan Schwoon. 2008. Symbolic Context-Bounded Analysis of Multithreaded Java Programs. In Proceedings of the 15th International SPIN Workshop on Model Checking Software (SPIN’08). Springer-Verlag, Berlin, Heidelberg, 270–287. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. CUBA: interprocedural Context-UnBounded Analysis of concurrent programs

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!