References

  1. Rajeev Alur & P. Madhusudan (2009): Adding nesting structure to words. J. ACM 56(3). Available at http://doi.acm.org/10.1145/1516512.1516518.
  2. Mohamed Faouzi Atig (2012): Model-Checking of Ordered Multi-Pushdown Automata. Logical Methods in Computer Science 8(3). Available at http://dx.doi.org/10.2168/LMCS-8(3:20)2012.
  3. Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar & Prakash Saivasan (2012): Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. In: Supratik Chakraborty & Madhavan Mukund: ATVA, Lecture Notes in Computer Science 7561. Springer, pp. 152–166. Available at http://dx.doi.org/10.1007/978-3-642-33386-6_13.
  4. Hans L. Bodlaender (1993): A Tourist Guide through Treewidth. Acta Cybern. 11(1-2), pp. 1–22. Available at http://www.inf.u-szeged.hu/kutatas/actacybernetica/vol11n12/bodlaen/bodlaen.xml.
  5. J. Büchi (1960): Weak second-order Arithmetic and Finite Automata.. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 6, pp. 66–92, doi:10.1002/malq.19600060105.
  6. Bruno Courcelle (1990): The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput. 85(1), pp. 12–75. Available at http://dx.doi.org/10.1016/0890-5401(90)90043-H.
  7. Javier Esparza, Pierre Ganty & Rupak Majumdar (2012): A Perfect Model for Bounded Verification. In: LICS. IEEE, pp. 285–294. Available at http://dx.doi.org/10.1109/LICS.2012.39.
  8. Vijay Ganesh, Sergey Berezin & David L. Dill (2002): Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods. In: Mark Aagaard & John W. O'Leary: FMCAD, Lecture Notes in Computer Science 2517. Springer, pp. 171–186. Available at http://dx.doi.org/10.1007/3-540-36126-X_11.
  9. Ralph E. Gomory (1960): An algorithm for the mixed integer problem. Technical Report. RAND Corporation.
  10. Alexander Heußner (2012): Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO. ECEASST 47. Available at http://journal.ub.tu-berlin.de/eceasst/article/view/725.
  11. Alexander Heußner, Jérôme Leroux, Anca Muscholl & Grégoire Sutre (2012): Reachability Analysis of Communicating Pushdown Systems. Logical Methods in Computer Science 8(3). Available at http://dx.doi.org/10.2168/LMCS-8(3:23)2012.
  12. Salvatore La Torre, P. Madhusudan & Gennaro Parlato (2007): A Robust Class of Context-Sensitive Languages. In: LICS. IEEE Computer Society, pp. 161–170. Available at http://doi.ieeecomputersociety.org/10.1109/LICS.2007.9.
  13. Salvatore La Torre, P. Madhusudan & Gennaro Parlato (2008): Context-Bounded Analysis of Concurrent Queue Systems. In: C. R. Ramakrishnan & Jakob Rehof: TACAS, Lecture Notes in Computer Science 4963. Springer, pp. 299–314. Available at http://dx.doi.org/10.1007/978-3-540-78800-3_21.
  14. Salvatore La Torre & Margherita Napoli (2011): Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. In: Joost-Pieter Katoen & Barbara König: CONCUR, Lecture Notes in Computer Science 6901. Springer, pp. 203–218. Available at http://dx.doi.org/10.1007/978-3-642-23217-6_14.
  15. Salvatore La Torre & Margherita Napoli (2012): A Temporal Logic for Multi-threaded Programs. In: Jos C. M. Baeten, Thomas Ball & Frank S. de Boer: IFIP TCS, Lecture Notes in Computer Science 7604. Springer, pp. 225–239. Available at http://dx.doi.org/10.1007/978-3-642-33475-7_16.
  16. Salvatore La Torre & Gennaro Parlato (2012): Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. In: Deepak D'Souza, Telikepalli Kavitha & Jaikumar Radhakrishnan: FSTTCS, LIPIcs 18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 173–184. Available at http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.173.
  17. A. H. Land & A. G. Doig (1960): An Automatic Method of Solving Discrete Programming Problems. Econometrica 28(3), pp. 497–520, doi:10.2307/1910129.
  18. A. K. Lenstra, H. W. Lenstra Jr. & L. Lovász (1982): Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), pp. 515–534, doi:10.1007/BF01457454.
  19. P. Madhusudan & Gennaro Parlato (2011): The tree width of auxiliary storage. In: Thomas Ball & Mooly Sagiv: POPL. ACM, pp. 283–294. Available at http://doi.acm.org/10.1145/1926385.1926419.
  20. Christos H. Papadimitriou (1981): On the complexity of integer programming. J. ACM 28(4), pp. 765–768. Available at http://doi.acm.org/10.1145/322276.322287.
  21. Rohit Parikh (1966): On Context-Free Languages. J. ACM 13(4), pp. 570–581. Available at http://doi.acm.org/10.1145/321356.321364.
  22. William Pugh (1992): A Practical Algorithm for Exact Array Dependence Analysis. Commun. ACM 35(8), pp. 102–114. Available at http://doi.acm.org/10.1145/135226.135233.
  23. Shaz Qadeer & Jakob Rehof (2005): Context-Bounded Model Checking of Concurrent Software. In: Nicolas Halbwachs & Lenore D. Zuck: TACAS, Lecture Notes in Computer Science 3440. Springer, pp. 93–107. Available at http://dx.doi.org/10.1007/978-3-540-31980-1_7.
  24. Detlef Seese (1991): The Structure of Models of Decidable Monadic Theories of Graphs. Ann. Pure Appl. Logic 53(2), pp. 169–195. Available at http://dx.doi.org/10.1016/0168-0072(91)90054-P.
  25. Pierre Wolper & Bernard Boigelot (1995): An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract). In: Alan Mycroft: SAS, Lecture Notes in Computer Science 983. Springer, pp. 21–32. Available at http://dx.doi.org/10.1007/3-540-60360-3_30.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org