404
S. Akshay et al.
16. Hague, M., Lin, A.W.: Synchronisation- and reversal-bounded analysis of multithreaded programs with counters. In: Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. p.
260–276 (2012), https://doi.org/10.1007/978-3-642-31424-7 22
17. Kung, H., Lehman, P.L.: Concurrent manipulation of binary search trees. ACM
Transactions on Database Systems (TODS) 5(3), 354–382 (1980)
18. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive
languages. In: Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE
Symposium on. pp. 161–170. IEEE (2007)
19. La Torre, S., Madhusudan, P., Parlato, G.: The language theory of bounded
context-switching. In: Latin American Symposium on Theoretical Informatics. pp.
96–107. Springer (2010)
20. La Torre, S., Napoli, M.: Reachability of multistack pushdown systems with scopebounded matching relations. In: International Conference on Concurrency Theory.
p. 203–218. Springer (2011)
21. La Torre, S., Parthasarathy, M., Parlato, G.: Analyzing recursive programs using
a fixed-point calculus. ACM Sigplan Notices 44(6), 211–222 (2009)
22. Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: ACM SIGPLAN Notices. vol. 46, pp. 283–294. ACM (2011)
23. Patin, G., Sighireanu, M., Touili, T.: Spade: Verification of multithreaded dynamic
and recursive programs. In: International Conference on Computer Aided Verification. pp. 254–257. Springer (2007)
24. Qadeer, S.: The case for context-bounded verification of concurrent programs. In:
Model Checking Software, 15th International SPIN Workshop, Los Angeles, CA,
USA, August 10-12, 2008, Proceedings. pp. 3–6 (2008), https://doi.org/10.1007/
978-3-540-85114-1 2
25. Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. ACM sigplan notices 39(6),
14–24 (2004)
26. Silberschatz, A., Gagne, G., Galvin, P.B.: Operating system concepts. Wiley (2018)
27. Torre, S.L., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. International Journal of Foundations of Computer Science 27(02), 215–233 (2016)
28. Torre, S.L., Parlato, G.: Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width 18, 173–184 (2012).
https://doi.org/10.4230/LIPIcs.FSTTCS.2012.173
Open Access This chapter is licensed under the terms of the Creative Commons
Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/),
which permits use, sharing, adaptation, distribution and reproduction in any medium
or format, as long as you give appropriate credit to the original author(s) and the
source, provide a link to the Creative Commons license and indicate if changes were
made.
The images or other third party material in this chapter are included in the chapter’s
Creative Commons license, unless indicated otherwise in a credit line to the material. If
material is not included in the chapter’s Creative Commons license and your intended
use is not permitted by statutory regulation or exceeds the permitted use, you will need
to obtain permission directly from the copyright holder.
S. Akshay et al.
16. Hague, M., Lin, A.W.: Synchronisation- and reversal-bounded analysis of multithreaded programs with counters. In: Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. p.
260–276 (2012), https://doi.org/10.1007/978-3-642-31424-7 22
17. Kung, H., Lehman, P.L.: Concurrent manipulation of binary search trees. ACM
Transactions on Database Systems (TODS) 5(3), 354–382 (1980)
18. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive
languages. In: Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE
Symposium on. pp. 161–170. IEEE (2007)
19. La Torre, S., Madhusudan, P., Parlato, G.: The language theory of bounded
context-switching. In: Latin American Symposium on Theoretical Informatics. pp.
96–107. Springer (2010)
20. La Torre, S., Napoli, M.: Reachability of multistack pushdown systems with scopebounded matching relations. In: International Conference on Concurrency Theory.
p. 203–218. Springer (2011)
21. La Torre, S., Parthasarathy, M., Parlato, G.: Analyzing recursive programs using
a fixed-point calculus. ACM Sigplan Notices 44(6), 211–222 (2009)
22. Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: ACM SIGPLAN Notices. vol. 46, pp. 283–294. ACM (2011)
23. Patin, G., Sighireanu, M., Touili, T.: Spade: Verification of multithreaded dynamic
and recursive programs. In: International Conference on Computer Aided Verification. pp. 254–257. Springer (2007)
24. Qadeer, S.: The case for context-bounded verification of concurrent programs. In:
Model Checking Software, 15th International SPIN Workshop, Los Angeles, CA,
USA, August 10-12, 2008, Proceedings. pp. 3–6 (2008), https://doi.org/10.1007/
978-3-540-85114-1 2
25. Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. ACM sigplan notices 39(6),
14–24 (2004)
26. Silberschatz, A., Gagne, G., Galvin, P.B.: Operating system concepts. Wiley (2018)
27. Torre, S.L., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. International Journal of Foundations of Computer Science 27(02), 215–233 (2016)
28. Torre, S.L., Parlato, G.: Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width 18, 173–184 (2012).
https://doi.org/10.4230/LIPIcs.FSTTCS.2012.173
Open Access This chapter is licensed under the terms of the Creative Commons
Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/),
which permits use, sharing, adaptation, distribution and reproduction in any medium
or format, as long as you give appropriate credit to the original author(s) and the
source, provide a link to the Creative Commons license and indicate if changes were
made.
The images or other third party material in this chapter are included in the chapter’s
Creative Commons license, unless indicated otherwise in a credit line to the material. If
material is not included in the chapter’s Creative Commons license and your intended
use is not permitted by statutory regulation or exceeds the permitted use, you will need
to obtain permission directly from the copyright holder.