{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:34Z","timestamp":1725491614051},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_10","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"136-150","source":"Crossref","is-referenced-by-count":14,"title":["Decidability Results for Well-Structured Transition Systems with Auxiliary Storage"],"prefix":"10.1007","author":[{"given":"R.","family":"Chadha","sequence":"first","affiliation":[]},{"given":"M.","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes. In: Proceedings of the International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp. 298\u2013312 (1998)","key":"10_CR2","DOI":"10.1007\/BFb0054179"},{"doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A Survey of Regular Model Checking. In: Proceedings of the International Conference on Concurrency Theory, pp. 35\u201348 (2004)","key":"10_CR3","DOI":"10.1007\/978-3-540-28644-8_3"},{"key":"10_CR4","first-page":"132","volume-title":"Proceedings of the IEEE Symposium on Logic in Computer Science","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Nyl\u2019en, A.: Better is better than Well: On efficient verification of infinite state systems. In: Proceedings of the IEEE Symposium on Logic in Computer Science, pp. 132\u2013140. IEEE Computer Society Press, Los Alamitos (2000)"},{"unstructured":"Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Collection des Publications de la Facult\u00e9 des Sciences Appliqu\u00e9es de l\u2019Universit\u00e9 de Li\u00e9ge (1999)","key":"10_CR5"},{"key":"10_CR6","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., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 348\u2013359. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Carayol, A., Wohrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 112\u2013123 (2003)","key":"10_CR7","DOI":"10.1007\/978-3-540-24597-1_10"},{"unstructured":"Chadha, R., Viswanthan, M.: Decidability results for well-structured transition systems with auxiliary storage. Technical Report UIUCDCS-R-2007-2865, Univ. of Illiniois at Urbana-Champaign (2007)","key":"10_CR8"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11730637_17","volume-title":"Hybrid Systems: Computation and Control","author":"M. Emmi","year":"2006","unstructured":"Emmi, M., Majumdar, R.: Decision problems for the verification of real-time software. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol.\u00a03927, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-30538-5_2","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"J. Esparza","year":"2004","unstructured":"Esparza, J., Etessami, K.: Verifying probabilistic procedural programs. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 16\u201331. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"10_CR12","first-page":"1","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"D. Gay","year":"2003","unstructured":"Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., Culler, D.: The nesC language: A holistic approach to networked embedded systems. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1\u201311. ACM Press, New York (2003)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with pvs. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., Pister, K.: System architecture directions for networked sensors. In: Proceedings of the International Conference on Architectural support for Programming Languages and Operating Systems, pp. 93\u2013104 (2000)","key":"10_CR14","DOI":"10.1145\/378993.379006"},{"doi-asserted-by":"crossref","unstructured":"Holub, A.: Taming Java Threads. APress (2000)","key":"10_CR15","DOI":"10.1007\/978-1-4302-1129-7"},{"key":"10_CR16","first-page":"339","volume-title":"Proceedings of the ACM Symposium on Principles of Programming Languages","author":"R. Jhala","year":"2007","unstructured":"Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 339\u2013350. ACM Press, New York (2007)"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J.B. Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory: Series A\u00a013(3), 297\u2013305 (1972)","journal-title":"Journal of Combinatorial Theory: Series A"},{"unstructured":"Libasync. http:\/\/pdos.csail.mit.edu\/6.824-2004\/async\/","key":"10_CR18"},{"unstructured":"Libevent. http:\/\/www.monkey.org\/provos\/libevent\/","key":"10_CR19"},{"unstructured":"Majumdar, R.: Personal communication","key":"10_CR20"},{"unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, Technical University Munich (1998)","key":"10_CR21"},{"doi-asserted-by":"crossref","unstructured":"Moller, F.: Infinite results. In: Proceedings of the Conference on Concurrency Theory, pp. 195\u2013216 (1996)","key":"10_CR22","DOI":"10.1007\/3-540-61604-7_56"},{"doi-asserted-by":"crossref","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Proceedings of the International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp. 93\u2013107 (2005)","key":"10_CR23","DOI":"10.1007\/978-3-540-31980-1_7"},{"key":"10_CR24","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)"},{"unstructured":"Vardhan, A.: Learning to Verify Systems. PhD thesis, University of Illinois, Urbana-Champaign (2005)","key":"10_CR25"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:57Z","timestamp":1619519097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}