Scope-bounded multistack pushdown systems: Fixed-point, sequentialization, and tree-width

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 18, Issue , 2012, Pages 173-184

  La Torre, Salvatore ^a   Parlato, Gennaro ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Model checking; Multi threaded programs; Sequentialization; Tree width

Indexed keywords

BEHAVIOR GRAPHS; CONTEXT SWITCH; COURCELLE'S THEOREMS; FIXED-POINT ALGORITHMS; MULTI-THREADED PROGRAMS; PUSHDOWN SYSTEMS; SEQUENTIALIZATION; TREE-WIDTH;

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES; FORESTRY; MODEL CHECKING; SOFTWARE ENGINEERING;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTER PROGRAMS; DECISION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEQUENCES;

EID: 84880232378     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2012.173     Document Type: Conference Paper

References (22)

1. Mohamed Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan. Linear-time model-checking for multithreaded programs under scope-bounding. In ATVA, volume 7561 of LNCS, pages 152-166, 2012.
2. Mohamed Faouzi Atig, Ahmed Bouajjani, and Gennaro Parlato. Getting rid of store-buffers in TSO analysis. In CAV, volume 6806 of LNCS, pages 99-115. Springer, 2011.
3. Mohamed Faouzi Atig, Ahmed Bouajjani, and Shaz Qadeer. Context-bounded analysis for concurrent programs with dynamic creation of threads. In TACAS, volume 5505 of LNCS, pages 107-123. Springer, 2009.
4. Ahmed Bouajjani and Michael Emmi. Bounded phase analysis of message-passing programs. In TACAS, volume 7214 of LNCS, pages 451-465. Springer, 2012.
5. Ahmed Bouajjani, Michael Emmi, and Gennaro Parlato. On sequentializing concurrent programs. In SAS, volume 6887 of LNCS, pages 129-145. Springer, 2011.
6. Ahmed Bouajjani, Séverine Fratani, and Shaz Qadeer. Context-bounded analysis of multithreaded programs with dynamic linked structures. In CAV, volume 4590 of LNCS, pages 207-220. Springer, 2007.
7. Aiswarya Cyriac, Paul Gastin, and K. Narayan Kumar. Mso decidability of multi-pushdown systems via split-width. In CONCUR, volume 7454 of LNCS, pages 547-561. Springer, 2012.
8. Michael Emmi, Shaz Qadeer, and Zvonimir Rakamaric. Delay-bounded scheduling. In ACM SIGPLAN-SIGACT POPL, pages 411-422, 2011.
9. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. A robust class of context-sensitive languages. In LICS, pages 161-170. IEEE Computer Society, 2007.
10. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. An infinite automaton characterization of double exponential time. In CSL, volume 5213 of LNCS, pages 33-48. Springer, 2008.
11. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Analyzing recursive programs using a fixed-point calculus. In PLDI, pages 211-222. ACM, 2009.
12. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Reducing context-bounded concurrent reachability to sequential reachability. In CAV, volume 5643 of LNCS, pages 477-492. Springer, 2009.
13. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Model-checking parameterized concurrent programs using linear interfaces. In CAV, volume 6174 of LNCS, pages 629-644. Springer, 2010.
14. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Sequentializing parameterized programs. In FIT, volume 87 of EPTCS, pages 34-47, 2012.
15. Salvatore La Torre and Margherita Napoli. Reachability of multistack pushdown systems with scope-bounded matching relations. In CONCUR, volume 6901 of LNCS, pages 203-218. Springer, 2011.
16. Salvatore La Torre and Margherita Napoli. A temporal logic for multi-threaded programs. In IFIP TCS, volume 7604 of LNCS, pages 225-239. Springer, 2012.
17. Akash Lal, Shaz Qadeer, and Shuvendu K. Lahiri. A solver for reachability modulo theories. In CAV, volume 7358 of LNCS, pages 427-443. Springer, 2012.
18. Akash Lal and Thomas W. Reps. Reducing concurrent analysis under a context bound to sequential analysis. In CAV, volume 5123 of LNCS, pages 37-51. Springer, 2008.
19. Akash Lal, Tayssir Touili, Nicholas Kidd, and Thomas W. Reps. Interprocedural analysis of concurrent programs under a context bound. In TACAS, volume 4963 of LNCS, pages 282-298. Springer, 2008.
20. P. Madhusudan and Gennaro Parlato. The tree width of auxiliary storage. In ACM SIGPLAN-SIGACT POPL, pages 283-294, 2011.
21. Shaz Qadeer and Jakob Rehof. Context-bounded model checking of concurrent software. In TACAS, volume 3440 of LNCS, pages 93-107. Springer, 2005.
22. Dejvuth Suwimonteerabuth, Javier Esparza, and Stefan Schwoon. Symbolic context-bounded analysis of multithreaded Java programs. In SPIN, volume 5156 of LNCS, pages 270-287. Springer, 2008.