Saturation of concurrent collapsible pushdown systems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 24, Issue , 2013, Pages 313-325

  Hague, Matthew ^a,b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITÉ PARIS EST   (France)

Author keywords

Automata; Concurrency; Higher order; Model checking; Verification

Indexed keywords

COMPUTABILITY AND DECIDABILITY; VERIFICATION;

AUTOMATA; CONCURRENCY; CONCURRENT COMPUTATION; HIGHER-ORDER; PROCEDURE CALL; PUSHDOWN SYSTEMS; REACHABILITY PROBLEM; REGULAR REPRESENTATIONS;

MODEL CHECKING;

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

References (32)

1. M. F. Atig. Model-checking of ordered multi-pushdown automata. In LMCS, 8(3), 2012.
2. M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of multi-pushdown automata is 2etimecomplete. In DLT, 2008.
3. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In POPL, 2002.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, 1997.
5. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. SIGPLAN Not., 38(1):62-73, 2003.
6. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. CONCUR, 2005.
7. L. Breveglieri, A. Cherubini, C. Citrini, and S. Crespi-Reghizzi. Multi-push-down languages and grammars. Int. J. Found. Comput. Sci., 7(3):253-292, 1996.
8. C. H. Broadbent, A. Carayol, M. Hague, and O. Serre. C-SHORe: A collapsible approach to verifying higher-order programs. To appear in ICFP, 2013.
9. C. H. Broadbent, A. Carayol, M. Hague, and O. Serre. A saturation method for collapsible pushdown systems. In ICALP, 2012.
10. A. Cyriac, P. Gastin, and K. N. Kumar. MSO decidability of multi-pushdown systems via split-width. In CONCUR, 2012.
11. W. Damm. The IO- and OI-hierarchies. Theor. Comput. Sci., 20:95-207, 1982.
12. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In INFINITY, 1997.
13. M. Hague. Saturation of concurrent collapsible pushdown systems, 2013. arXiv:1310.2631 [cs.FL].
14. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In LICS, 2008.
15. A. Heußner, J. Leroux, A. Muscholl, and G. Sutre. Reachability analysis of communicating pushdown systems. In FOSSACS, 2010.
16. V. Kahlon. Reasoning about threads with bounded lock chains. In CONCUR, 2011.
17. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In ICALP, 2005.
18. N. Kobayashi. Higher-order model checking: From theory to practice. In LICS, 2011.
19. N. Kobayashi and A. Igarashi. Model-Checking Higher-Order Programs with Recursive Types In ESOP, 2013.
20. S. La Torre and M. Napoli. A temporal logic for multi-threaded programs. In IFIP TCS, 2012.
21. S. La Torre and G. Parlato. Scope-bounded multistack pushdown systems: Fixed-point, sequentialization, and tree-width. In FSTTCS, 2012.
22. P. Madhusudan and G. Parlato. The tree width of auxiliary storage. In POPL, 2011.
23. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS, 2006.
24. L. Ong. Recursion schemes, collapsible pushdown automata and higher-order model checking. In LATA, 2013.
25. S. Qadeer. The case for context-bounded verification of concurrent programs. In SPIN, 2008.
26. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, 2005.
27. S. Schwoon. Model-checking Pushdown Systems. PhD thesis, Technical University of Munich, 2002.
28. K. Sen and M. Viswanathan. Model checking multithreaded programs with asynchronous atomic methods. In CAV, 2006.
29. A. Seth. Games on higher order multi-stack pushdown systems. In RP, 2009.
30. A. Seth. Global reachability in bounded phase multi-stack pushdown systems. In CAV, 2010.
31. S. L. Torre, P. Madhusudan, and G. Parlato. A robust class of context-sensitive languages. In LICS, 2007.
32. S. L. Torre and M. Napoli. Reachability of multistack pushdown systems with scopebounded matching relations. In CONCUR, 2011.