{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:47:39Z","timestamp":1725727659674},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385919"},{"type":"electronic","value":"9783642385926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38592-6_16","type":"book-chapter","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T00:56:11Z","timestamp":1369788971000},"page":"225-241","source":"Crossref","is-referenced-by-count":2,"title":["Asynchronously Communicating Visibly Pushdown Systems"],"prefix":"10.1007","author":[{"given":"Domagoj","family":"Babi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvonimir","family":"Rakamari\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 35\u201348. Springer, Heidelberg (2004)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Annual ACM Symp.\u00a0on Theory of Computing (STOC), pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"16_CR3","unstructured":"Babi\u0107, D., Rakamari\u0107, Z.: Asynchronously communicating visibly pushdown systems. Technical Report UCB\/EECS-2011-108, University of California, Berkeley (October 2011)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Conf.\u00a0on Programming Language Design and Implementation (PLDI), pp. 203\u2013213 (2001)","DOI":"10.1145\/381694.378846"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-27940-9_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Basu","year":"2012","unstructured":"Basu, S., Bultan, T., Ouederni, M.: Synchronizability for verification of asynchronously communicating systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 56\u201371. Springer, Heidelberg (2012)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0032741","volume-title":"Static Analysis","author":"B. Boigelot","year":"1997","unstructured":"Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 172\u2013186. Springer, Heidelberg (1997)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2005.11.015","volume":"149","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking. Electronic Notes in Theoretical Computer Science\u00a0149, 37\u201348 (2006)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27813-9_29","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2004","unstructured":"Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 372\u2013386. Springer, Heidelberg (2004)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of ACM\u00a030, 323\u2013342 (1983)","journal-title":"Journal of ACM"},{"key":"16_CR11","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                    \n                      http:\/\/tata.gforge.inria.fr\/"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/0021-8693(69)90107-0","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Elgot, C.C., Shepherdson, J.C.: Sets recognized by n-tape automata. Journal of Algebra\u00a013, 447\u2013464 (1969)","journal-title":"Journal of Algebra"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theoretical Computer Science\u00a0108, 45\u201382 (1993)","journal-title":"Theoretical Computer Science"},{"key":"16_CR14","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. Computing Research Repository (CoRR), abs\/1011.0551 (2010)"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identication in the limit. Info. and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Info. and Control"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhum\u00e4ki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science\u00a078, 347\u2013355 (1991)","journal-title":"Theoretical Computer Science"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Hill, J.L., Szewczyk, R., Woo, A., Hollar, S., Culler, D.E., Pister, K.S.J.: System architecture directions for networked sensors. In: Intl.\u00a0Conf.\u00a0on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 93\u2013104 (2000)","DOI":"10.1145\/384264.379006"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/354871.354874","volume":"18","author":"E. Kohler","year":"2000","unstructured":"Kohler, E., Morris, R., Chen, B., Jannotti, J., Kaashoek, M.F.: The Click modular router. ACM Transactions on Computer Systems\u00a018(3), 263\u2013297 (2000)","journal-title":"ACM Transactions on Computer Systems"},{"key":"16_CR20","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.\u00a04963, pp. 299\u2013314. Springer, Heidelberg (2008)"},{"key":"16_CR21","unstructured":"Pachl, J.K.: Reachability problems for communicating finite state machines. Technical Report CS-82-12, Department of Computer Science, University of Waterloo (1982)"},{"key":"16_CR22","unstructured":"Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Intl.\u00a0Conf.\u00a0on Protocol Specification, Testing and Verification (PSTV), pp. 207\u2013219 (1987)"},{"key":"16_CR23","unstructured":"Pai, V.S., Druschel, P., Zwaenepoel, W.: Flash: An efficient and portable Web server. In: USENIX Annual Technical Conference, pp. 199\u2013212 (1999)"},{"key":"16_CR24","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.\u00a03440, pp. 93\u2013107. Springer, Heidelberg (2005)"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/349214.349241","volume":"22","author":"G. Ramalingam","year":"2000","unstructured":"Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Programming Languages and Systems\u00a022, 416\u2013430 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70583-3_32","volume-title":"Automata, Languages and Programming","author":"J.-F. Raskin","year":"2008","unstructured":"Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 386\u2013397. Springer, Heidelberg (2008)"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/11817963_29","volume-title":"Computer Aided Verification","author":"K. Sen","year":"2006","unstructured":"Sen, K., Viswanathan, M.: Model checking multithreaded programs with asynchronous atomic methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 300\u2013314. Springer, Heidelberg (2006)"},{"key":"16_CR29","unstructured":"Thomas, W.: On logical definability of trace languages. In: ASMICS Workshop, Technical University of Munich, Report TUM-I9002, pp. 172\u2013182 (1990)"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-30482-1_26","volume-title":"Formal Methods and Software Engineering","author":"A. Vardhan","year":"2004","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Learning to verify safety properties. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol.\u00a03308, pp. 274\u2013289. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38592-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T08:56:50Z","timestamp":1557737810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38592-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385919","9783642385926"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38592-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}