{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:44:38Z","timestamp":1725853478590},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496732"},{"type":"electronic","value":"9783662496749"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49674-9_45","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T14:49:00Z","timestamp":1460126940000},"page":"698-714","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Acceleration in Multi-PushDown Systems"],"prefix":"10.1007","author":[{"given":"Mohamed Faouzi","family":"Atig","sequence":"first","affiliation":[]},{"given":"K.","family":"Narayan Kumar","sequence":"additional","affiliation":[]},{"given":"Prakash","family":"Saivasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/10722167_32","volume-title":"Computer Aided Verification","author":"A Annichini","year":"2000","unstructured":"Annichini, A., Asarin, E., Bouajjani, A.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 419\u2013434. Springer, Heidelberg (2000)"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-85780-8_9","volume-title":"Developments in Language Theory","author":"MF Atig","year":"2008","unstructured":"Atig, M.F., Bollig, B., Habermehl, P.: Emptiness of multi-pushdown automata is 2ETIME-complete. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 121\u2013133. Springer, Heidelberg (2008)"},{"issue":"3","key":"45_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(3:20)2012","volume":"8","author":"MF Atig","year":"2012","unstructured":"Atig, M.F.: Model-checking of ordered multi-pushdown automata. Logical Methods Comput. Sci. 8(3), 1\u201331 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-33386-6_13","volume-title":"Automated Technology for Verification and Analysis","author":"MF Atig","year":"2012","unstructured":"Atig, M.F., Bouajjani, A., Narayan Kumar, K., Saivasan, P.: Linear-time model-checking for multithreaded programs under scope-bounding. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 152\u2013166. Springer, Heidelberg (2012)"},{"issue":"4","key":"45_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.2168\/LMCS-7(4:4)2011","volume":"7","author":"MF Atig","year":"2011","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods Comput. Sci. 7(4), 107\u2013123 (2011)","journal-title":"Logical Methods Comput. Sci."},{"key":"45_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-38771-5_7","volume-title":"Developments in Language Theory","author":"MF Atig","year":"2013","unstructured":"Atig, M.F., Narayan Kumar, K., Saivasan, P.: Adjacent ordered multi-pushdown systems. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 58\u201369. Springer, Heidelberg (2013)"},{"issue":"5","key":"45_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","volume":"10","author":"S Bardin","year":"2008","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. STTT 10(5), 401\u2013424 (2008)","journal-title":"STTT"},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11562948_35","volume-title":"Automated Technology for Verification and Analysis","author":"S Bardin","year":"2005","unstructured":"Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in symbolic model checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474\u2013488. Springer, Heidelberg (2005)"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-48320-9_14","volume-title":"CONCUR\u201999. Concurrency Theory","author":"B B\u00e9rard","year":"1999","unstructured":"B\u00e9rard, B., Fribourg, L.: Reachability analysis of (timed) Petri nets using real arithmetic. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 178\u2013193. Springer, Heidelberg (1999)"},{"key":"45_CR10","series-title":"TeubnerStudienbucher Informatik","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free langages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and context-free langages. TeubnerStudienbucher Informatik. Springer, Heidelberg (1979)"},{"issue":"1\u20133","key":"45_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0304-3975(03)00314-1","volume":"309","author":"B Boigelot","year":"2003","unstructured":"Boigelot, B.: On iterating linear transformations over recognizable sets of integers. Theor. Comput. Sci. 309(1\u20133), 413\u2013468 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"45_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10009-011-0206-x","volume":"14","author":"B Boigelot","year":"2012","unstructured":"Boigelot, B.: Domain-specific regular acceleration. STTT 14(2), 193\u2013206 (2012)","journal-title":"STTT"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-58179-0_43","volume-title":"Computer Aided Verification","author":"B Boigelot","year":"1994","unstructured":"Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) Computer Aided Verification. LNCS, vol. 818, pp. 55\u201367. Springer, Heidelberg (1994)"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"45_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11590156_28","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"A Bouajjani","year":"2005","unstructured":"Bouajjani, A., Esparza, J., Schwoon, S., Strej\u010dek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 348\u2013359. Springer, Heidelberg (2005)"},{"issue":"1\u20132","key":"45_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00033-X","volume":"221","author":"A Bouajjani","year":"1999","unstructured":"Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FiFo-channel systems with nonregular sets of configurations. Theor. Comput. Sci. 221(1\u20132), 211\u2013250 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR17","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: On the expressiveness of Parikh automata and related models. In: NCMA. books@ocg.at, vol. 282, pp. 103\u2013119. Austrian Computer Society (2011)"},{"issue":"8","key":"45_CR18","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1142\/S0129054112400709","volume":"23","author":"M Cadilhac","year":"2012","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Bounded parikh automata. Int. J. Found. Comput. Sci. 23(8), 1691\u20131710 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"45_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D Caucal","year":"1992","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. Theor. Comput. Sci. 106(1), 61\u201386 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-49019-1_2","volume-title":"Foundations of Software Science and Computation Structures","author":"J Esparza","year":"1999","unstructured":"Esparza, J., Knoop, J., Majumdar, R.: An automata-theoretic approach to interprocedural data-flow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 14\u201330. Springer, Heidelberg (1999)"},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: A perfect model for bounded verification. In: LICS, pp. 285\u2013294. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.39"},{"issue":"3","key":"45_CR22","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2629644","volume":"36","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Ganty, P., Poch, T.: Pattern-based verification for multithreaded programs. ACM Trans. Program. Lang. Syst. 36(3), 9:1\u20139:29 (2014)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"45_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11691372_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Esparza","year":"2006","unstructured":"Esparza, J., Kiefer, S., Schwoon, S.: Abstraction refinement with craig interpolation and symbolic pushdown systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 489\u2013503. Springer, Heidelberg (2006)"},{"key":"45_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-18088-5_43","volume-title":"Automata, Languages and Programming","author":"A Finkel","year":"1987","unstructured":"Finkel, A.: A generalization of the procedure of Karp and Miller to well structured. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 499\u2013508. Springer, Heidelberg (1987)"},{"key":"45_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36206-1_14","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"A Finkel","year":"2002","unstructured":"Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145\u2013156. Springer, Heidelberg (2002)"},{"key":"45_CR26","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S1571-0661(05)80426-8","volume":"9","author":"A Finkel","year":"1997","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. Electr. Notes Theor. Comput. Sci. 9, 27\u201337 (1997)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"2","key":"45_CR27","first-page":"206","volume":"40","author":"P Ganty","year":"2012","unstructured":"Ganty, P., Majumdar, R., Monmege, B.: Bounded underapproximations. FMSD 40(2), 206\u2013231 (2012)","journal-title":"FMSD"},{"key":"45_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-12032-9_19","volume-title":"Foundations of Software Science and Computational Structures","author":"A Heu\u00dfner","year":"2010","unstructured":"Heu\u00dfner, A., Leroux, J., Muscholl, A., Sutre, G.: Reachability analysis of communicating pushdown systems. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 267\u2013281. Springer, Heidelberg (2010)"},{"issue":"2","key":"45_CR29","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"45_CR30","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF03356760","volume":"24","author":"W Kelly","year":"1996","unstructured":"Kelly, W., Pugh, W., Rosser, E., Shpeisman, T.: Transitive closure of infinite graphs and its applications. J. Parallel Program. 24(6), 579\u2013598 (1996)","journal-title":"J. Parallel Program."},{"key":"45_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) Automata, Languages and Programming. LNCS, vol. 2719, pp. 681\u2013696. Springer, Heidelberg (2003)"},{"key":"45_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-78800-3_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Torre La","year":"2008","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of concurrent queue systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299\u2013314. Springer, Heidelberg (2008)"},{"key":"45_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-02658-4_36","volume-title":"Computer Aided Verification","author":"S Torre La","year":"2009","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Reducing context-bounded concurrent reachability to sequential reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 477\u2013492. Springer, Heidelberg (2009)"},{"issue":"1","key":"45_CR34","first-page":"73","volume":"35","author":"A Lal","year":"2009","unstructured":"Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. FMSD 35(1), 73\u201397 (2009)","journal-title":"FMSD"},{"key":"45_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-78800-3_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Lal","year":"2008","unstructured":"Lal, A., Touili, T., Kidd, N., Reps, T.: Interprocedural analysis of concurrent programs under a context bound. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 282\u2013298. Springer, Heidelberg (2008)"},{"key":"45_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-02444-8_1","volume-title":"Automated Technology for Verification and Analysis","author":"J Leroux","year":"2013","unstructured":"Leroux, J.: Acceleration for Petri nets. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 1\u20134. Springer, Heidelberg (2013)"},{"key":"45_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11562948_36","volume-title":"Automated Technology for Verification and Analysis","author":"J Leroux","year":"2005","unstructured":"Leroux, J., Sutre, G.: Flat counter automata almost everywhere!. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"issue":"6","key":"45_CR38","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/1273442.1250785","volume":"42","author":"Madanlal Musuvathi","year":"2007","unstructured":"Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: PLDI, pp. 446\u2013455. ACM (2007)","journal-title":"ACM SIGPLAN Notices"},{"key":"45_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-31980-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93\u2013107. Springer, Heidelberg (2005)"},{"key":"45_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44898-5_11","volume-title":"Static Analysis","author":"T Reps","year":"2003","unstructured":"Reps, T., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: Cousot, R. (ed.) Static Analysis. LNCS, vol. 2694, pp. 189\u2013213. Springer, Heidelberg (2003)"},{"issue":"2","key":"45_CR41","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10009-013-0290-1","volume":"16","author":"F Song","year":"2014","unstructured":"Song, F., Touili, T.: Pushdown model checking for malware detection. STTT 16(2), 147\u2013173 (2014)","journal-title":"STTT"},{"key":"45_CR42","unstructured":"Wong, K.: Parikh automata with pushdown stack. Diploma thesis, RWTH Aachen (2004)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49674-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:16:02Z","timestamp":1584998162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49674-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496732","9783662496749"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49674-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}