Revisiting Underapproximate Reachability for Multipushdown Systems
403
References
1. Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In:
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012. p. 35–44 (2012), https:
//doi.org/10.1109/LICS.2012.15
2. Abdulla, P.A., Atig, M.F., Stenman, J.: The minimal cost reachability problem in
priced timed pushdown systems. In: Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coru˜ na, Spain, March 5-9,
2012. Proceedings. pp. 58–69 (2012), https://doi.org/10.1007/978-3-642-28332-1 6
3. Akshay, S., Gastin, P., Jug´ e, V., Krishna, S.N.: Timed systems through the lens
of logic. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. pp. 1–13 (2019)
4. Akshay, S., Gastin, P., Krishna, S., Roychowdhury, S.: Revisiting underapproximate reachability for multipushdown systems (2020), https://arxiv.org/abs/2002.
05950
5. Akshay, S., Gastin, P., Krishna, S.N.: Analyzing Timed Systems Using Tree Automata. Logical Methods in Computer Science Volume 14, Issue 2 (May 2018),
https://lmcs.episciences.org/4489
6. Akshay, S., Gastin, P., Krishna, S.N., Sarkar, I.: Towards an efficient tree automata based technique for timed systems. In: 28th International Conference on
Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany. pp.
39:1–39:15 (2017), https://doi.org/10.4230/LIPIcs.CONCUR.2017.39
7. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the
thirty-sixth annual ACM symposium on Theory of computing. pp. 202–211. ACM
(2004)
8. Atig, M.F.: Model-Checking of Ordered Multi-Pushdown Automata. Logical Methods in Computer Science Volume 8, Issue 3 (Sep 2012).
https://doi.org/10.2168/LMCS-8(3:20)2012
9. Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A perfect class of
context-sensitive timed languages. In: International Conference on Developments
in Language Theory. pp. 38–50. Springer, Berlin, Heidelberg (2016)
10. Bouajjani, A., Echahed, R., Robbana, R.: On the automatic verification of systems
with continuous variables and unbounded discrete data structures. In: International
Hybrid Systems Workshop. pp. 64–85. Springer (1994)
11. Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T.: Verifying concurrent messagepassing C programs with recursive calls. In: International Conference on Tools and
Algorithms for the Construction and Analysis of Systems. p. 334–349. Springer
(2006)
12. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms.
MIT press (2009)
13. Cyriac, A.: Verification of communicating recursive programs via split-width.
(V´ erification de programmes r´ ecursifs et communicants via split-width). Ph.D.
thesis, ´
Ecole normale sup´ erieure de Cachan, France (2014), https://tel.
archives-ouvertes.fr/tel-01015561
14. Cyriac, A., Gastin, P., Kumar, K.N.: MSO decidability of multi-pushdown systems
via split-width. In: International Conference on Concurrency Theory. pp. 547–561.
Springer, Berlin, Heidelberg (2012)
15. Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability
analysis of discrete pushdown timed automata. In: International Conference on
Computer Aided Verification. p. 69–84. Springer (2000)
403
References
1. Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In:
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012. p. 35–44 (2012), https:
//doi.org/10.1109/LICS.2012.15
2. Abdulla, P.A., Atig, M.F., Stenman, J.: The minimal cost reachability problem in
priced timed pushdown systems. In: Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coru˜ na, Spain, March 5-9,
2012. Proceedings. pp. 58–69 (2012), https://doi.org/10.1007/978-3-642-28332-1 6
3. Akshay, S., Gastin, P., Jug´ e, V., Krishna, S.N.: Timed systems through the lens
of logic. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. pp. 1–13 (2019)
4. Akshay, S., Gastin, P., Krishna, S., Roychowdhury, S.: Revisiting underapproximate reachability for multipushdown systems (2020), https://arxiv.org/abs/2002.
05950
5. Akshay, S., Gastin, P., Krishna, S.N.: Analyzing Timed Systems Using Tree Automata. Logical Methods in Computer Science Volume 14, Issue 2 (May 2018),
https://lmcs.episciences.org/4489
6. Akshay, S., Gastin, P., Krishna, S.N., Sarkar, I.: Towards an efficient tree automata based technique for timed systems. In: 28th International Conference on
Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany. pp.
39:1–39:15 (2017), https://doi.org/10.4230/LIPIcs.CONCUR.2017.39
7. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the
thirty-sixth annual ACM symposium on Theory of computing. pp. 202–211. ACM
(2004)
8. Atig, M.F.: Model-Checking of Ordered Multi-Pushdown Automata. Logical Methods in Computer Science Volume 8, Issue 3 (Sep 2012).
https://doi.org/10.2168/LMCS-8(3:20)2012
9. Bhave, D., Dave, V., Krishna, S.N., Phawade, R., Trivedi, A.: A perfect class of
context-sensitive timed languages. In: International Conference on Developments
in Language Theory. pp. 38–50. Springer, Berlin, Heidelberg (2016)
10. Bouajjani, A., Echahed, R., Robbana, R.: On the automatic verification of systems
with continuous variables and unbounded discrete data structures. In: International
Hybrid Systems Workshop. pp. 64–85. Springer (1994)
11. Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T.: Verifying concurrent messagepassing C programs with recursive calls. In: International Conference on Tools and
Algorithms for the Construction and Analysis of Systems. p. 334–349. Springer
(2006)
12. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms.
MIT press (2009)
13. Cyriac, A.: Verification of communicating recursive programs via split-width.
(V´ erification de programmes r´ ecursifs et communicants via split-width). Ph.D.
thesis, ´
Ecole normale sup´ erieure de Cachan, France (2014), https://tel.
archives-ouvertes.fr/tel-01015561
14. Cyriac, A., Gastin, P., Kumar, K.N.: MSO decidability of multi-pushdown systems
via split-width. In: International Conference on Concurrency Theory. pp. 547–561.
Springer, Berlin, Heidelberg (2012)
15. Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability
analysis of discrete pushdown timed automata. In: International Conference on
Computer Aided Verification. p. 69–84. Springer (2000)