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.
Supplemental Material
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Salvatore La Torre, Margherita Napoli, and Gennaro Parlato. 2016. Scope-Bounded Pushdown Languages. Int. J. Found. Comput. Sci. 27, 02 (2016), 215–233.Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- Peizun Liu and Thomas Wahl. 2018. The Homepage of CUBA. (2018). Retrieved April, 2018 from http://www.ccs.neu.edu/home/lpzun/cuba/Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- G. Ramalingam. 2000. Context-sensitive Synchronization-sensitive Analysis is Undecidable. ACM Trans. Program. Lang. Syst. 22, 2 (March 2000), 416–430. Google Scholar
Digital Library
- Stefan Schwoon. 2000. Model-Checking Pushdown Systems. Ph.D. Dissertation. Lehrstuhl für Informatik VII der Technischen Universität München.Google Scholar
- 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 Scholar
Digital Library
Index Terms
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs
Recommendations
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and ImplementationA 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 ...
Dataflow analysis for concurrent programs using datarace detection
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationDataflow analyses for concurrent programs differ from their single-threaded counterparts in that they must account for shared memory locations being overwritten by concurrent threads. Existing dataflow analysis techniques for concurrent programs ...
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences
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 ...







Comments