skip to main content
research-article

The tree width of auxiliary storage

Authors Info & Claims
Published:26 January 2011Publication History
Skip Abstract Section

Abstract

We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently been proved. Our generalization relies on reducing emptiness of these automata to finite-state graph automata (without storage) restricted to monadic second-order (MSO) definable graphs of bounded tree-width, where the graph structure encodes the mechanism provided by the auxiliary storage. Our results outline a uniform mechanism to derive emptiness algorithms for automata, explaining and simplifying several existing results, as well as proving new decidability results.

Skip Supplemental Material Section

Supplemental Material

27-mpeg-4.mp4

References

  1. R. Alur and P. Madhusudan. Visibly pushdown languages. In L. Babai, editor, STOC, pages 202--211. ACM, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Alur and P. Madhusudan. Adding nesting structure to words. In O. H. Ibarra and Z. Dang, editors, Developments in Language Theory, volume 4036 of Lecture Notes in Computer Science, pages 1--13. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Alur and P. Madhusudan. Adding nesting structure to words. J. ACM, 56 (3), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In K. Jensen and A. Podelski, editors, TACAS, volume 2988 of Lecture Notes in Computer Science, pages 467--481. Springer, 2004.Google ScholarGoogle Scholar
  5. M. F. Atig. Global model checking of ordered multi-pushdown systems. In K. Lodaya and M. Mahajan, editors, Proceedings of the 30th Conference on FSTTCS, Leibniz International Proceedings in Informatics, Chennai, India, Dec. 2010. To appear.Google ScholarGoogle Scholar
  6. M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of multi-pushdown automata is 2etime-complete. In M. Ito and M. Toyama, editors, Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, pages 121--133. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI, pages 203--213, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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.Google ScholarGoogle ScholarCross RefCross Ref
  9. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars, pages 313--400. World Scientific, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101 (1--3): 77--114, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst., 33 (2): 125--150, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  12. J. Flum and M. Grohe. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Heußner, J. Leroux, A. Muscholl, and G. Sutre. Reachability analysis of communicating pushdown systems. In C.-H. L. Ong, editor, FOSSACS, volume 6014 of Lecture Notes in Computer Science, pages 267--281. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. La Torre, P. Madhusudan, and G. Parlato. A robust class of context-sensitive languages. In LICS, pages 161--170. IEEE Computer Society, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. La Torre, P. Madhusudan, and G. Parlato. An infinite automaton characterization of double exponential time. In M. Kaminski and S. Martini, editors, CSL, volume 5213 of Lecture Notes in Computer Science, pages 33--48. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. La Torre, P. Madhusudan, and G. Parlato. Context-bounded analysis of concurrent queue systems. In C. R. Ramakrishnan and J. Rehof, editors, TACAS, volume 4963 of Lecture Notes in Computer Science, pages 299--314. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. La Torre, P. Madhusudan, and G. Parlato. Analyzing recursive programs using a fixed-point calculus. In M. Hind and A. Diwan, editors, PLDI, pages 211--222. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. La Torre, P. Madhusudan, and G. Parlato. Model-checking parameterized concurrent programs using linear interfaces. In T. Touili, B. Cook, and P. Jackson, editors, CAV, volume 6174 of Lecture Notes in Computer Science, pages 629--644. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. P. Madhusudan and G. Parlato. The tree width of automata with auxiliary storage. In IDEALS Technical Report http://hdl.handle.net/2142/15433, April 2010.Google ScholarGoogle Scholar
  21. R. Parikh. On context-free languages. J. ACM, 13 (4): 570--581, 1966. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In N. Halbwachs and L. D. Zuck, editors, TACAS, volume 3440 of Lecture Notes in Computer Science, pages 93--107. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Seese. The structure of models of decidable monadic theories of graphs. Ann. Pure Appl. Logic, 53 (2): 169--195, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  24. W. Thomas. On logics, tilings, and automata. In J. L. Albert, B. Monien, and M. Rodríıguez-Artalejo, editors, ICALP, volume 510 of Lecture Notes in Computer Science, pages 441--454. Springer, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The tree width of auxiliary storage

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in

                  Full Access

                  • Published in

                    cover image ACM SIGPLAN Notices
                    ACM SIGPLAN Notices  Volume 46, Issue 1
                    POPL '11
                    January 2011
                    624 pages
                    ISSN:0362-1340
                    EISSN:1558-1160
                    DOI:10.1145/1925844
                    Issue’s Table of Contents
                    • cover image ACM Conferences
                      POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
                      January 2011
                      652 pages
                      ISBN:9781450304900
                      DOI:10.1145/1926385

                    Copyright © 2011 ACM

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 26 January 2011

                    Check for updates

                    Qualifiers

                    • research-article

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader
                  About Cookies On This Site

                  We use cookies to ensure that we give you the best experience on our website.

                  Learn more

                  Got it!