{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:58:32Z","timestamp":1725569912183},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169007"},{"type":"electronic","value":"9783642169014"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16901-4_23","type":"book-chapter","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T17:40:06Z","timestamp":1289238006000},"page":"338-354","source":"Crossref","is-referenced-by-count":6,"title":["Automating Cut-off for Multi-parameterized Systems"],"prefix":"10.1007","author":[{"given":"Youssef","family":"Hanna","sequence":"first","affiliation":[]},{"given":"David","family":"Samuelson","sequence":"additional","affiliation":[]},{"given":"Samik","family":"Basu","sequence":"additional","affiliation":[]},{"given":"Hridesh","family":"Rajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: An exercise in the verification of multi-process programs. Beauty is our business: a birthday salute to Edsger W. Dijkstra, pp. 289\u2013301 (1990)","DOI":"10.1007\/978-1-4612-4476-9_34"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"K.R. Apt","year":"1986","unstructured":"Apt, K.R., Kozen, D.C.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett.\u00a022(6), 307\u2013309 (1986)","journal-title":"Inf. Process. Lett."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-78800-3_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.M. Clarke","year":"2008","unstructured":"Clarke, E.M., Talupur, M., Veith, H.: Proving ptolemy right: The environment abstraction framework for model checking concurrent systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 33\u201347. Springer, Heidelberg (2008)"},{"key":"23_CR4","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)"},{"issue":"7","key":"23_CR5","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ic.2008.04.002","volume":"206","author":"P. Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A framework for the verification of infinite-state graph transformation systems. Inf. Comput.\u00a0206(7), 869\u2013907 (2008)","journal-title":"Inf. Comput."},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-78800-3_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Saksena","year":"2008","unstructured":"Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Przydatek, B., Song, D., Perrig, A.: Sia: secure information aggregation in sensor networks. In: SenSys. (2003)","DOI":"10.1145\/958491.958521"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/5.747866","volume":"87","author":"G. Byrd","year":"1999","unstructured":"Byrd, G., Flynn, M.: Producer-consumer communication in distributed shared memory multi-processors. Proceedings of the IEEE\u00a087(3), 456\u2013466 (1999)","journal-title":"Proceedings of the IEEE"},{"key":"23_CR9","unstructured":"Marelly, R., Grumberg, O.: Gormel - grammar oriented model checker. Technical Report 697, The Technion (1992)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-44585-4_19","volume-title":"Computer Aided Verification","author":"T. Arons","year":"2001","unstructured":"Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.D.: Parameterized verification with automatically computed inductive assertions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 221\u2013234. Springer, Heidelberg (2001)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-46002-0_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.A. Emerson","year":"2002","unstructured":"Emerson, E.A., Kahlon, V.: Model checking large-scale and parameterized resource allocation systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 251\u2013265. Springer, Heidelberg (2002)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Hanna, Y., Basu, S., Rajan, H.: Behavioral automata composition for automatic topology independent verification of parameterized systems. In: ESEC\/FSE 2009 (August 2009)","DOI":"10.1145\/1595696.1595758"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and modal logic, pp. 995\u20131072 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Yavuz-Kahveci, T., Bultan, T.: Verification of parameterized hierarchical state machines using action language verifier. In: MEMOCODE 2005, pp. 79\u201388 (2005)","DOI":"10.1109\/MEMCOD.2005.1487897"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:AUSE.0000017740.35552.88","volume":"11","author":"A. Roychoudhury","year":"2004","unstructured":"Roychoudhury, A., Ramakrishnan, I.V.: Inductively verifying invariant properties of parameterized systems. Automated Software Engg.\u00a011(2), 101\u2013139 (2004)","journal-title":"Automated Software Engg."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-60218-6_30","volume-title":"CONCUR \u201995 Concurrency Theory","author":"E.M. Clarke","year":"1995","unstructured":"Clarke, E.M., Grumberg, O., Jha, S.: Verifying parameterized networks using abstraction and regular languages. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 395\u2013407. Springer, Heidelberg (1995)"},{"issue":"3-4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cl.2004.02.006","volume":"30","author":"L.D. Zuck","year":"2004","unstructured":"Zuck, L.D., Pnueli, A.: Model checking and abstraction to the aid of parameterized systems (a survey). Computer Languages, Systems & Structures\u00a030(3-4), 139\u2013169 (2004)","journal-title":"Computer Languages, Systems & Structures"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-05089-3_9","volume-title":"FM 2009: Formal Methods","author":"J. Sun","year":"2009","unstructured":"Sun, J., Liu, Y., Roychoudhury, A., Liu, S., Dong, J.S.: Fair model checking with process counter abstraction. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 123\u2013139. Springer, Heidelberg (2009)"},{"key":"23_CR19","unstructured":"Dijkstra, E.: Two starvation free solutions to a general exclusion problem. EWD 625, Plataanstraat 5, 5671 AL Neunen, The Netherlands"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1010051815785","volume":"11","author":"H. Abelson","year":"1998","unstructured":"Abelson, H., et al.: Revised report on the algorithmic language scheme. Higher Order Symbol. Comput.\u00a011(1), 7\u2013105 (1998)","journal-title":"Higher Order Symbol. Comput."},{"key":"23_CR21","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1982","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1982)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0013025","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"A.W. Mazurkiewicz","year":"1989","unstructured":"Mazurkiewicz, A.W.: Basic notions of trace theory. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 285\u2013363. Springer, Heidelberg (1989)"},{"key":"23_CR23","volume-title":"Operating System Concepts","author":"A. Silberschatz","year":"2004","unstructured":"Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts. Wiley, Chichester (2004)"},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T.E. Anderson","year":"1990","unstructured":"Anderson, T.E.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst.\u00a01(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Wolper, P., Lovinfosse, V.: Verifying properties of large sets of processes with network invariants. In: Workshop on Automatic Verification Methods for Finite State Systems, pp. 68\u201380 (1990)","DOI":"10.1007\/3-540-52148-8_6"},{"issue":"2","key":"23_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2005.11.016","volume":"354","author":"S. Basu","year":"2006","unstructured":"Basu, S., Ramakrishnan, C.R.: Compositional analysis for verification of parameterized systems. Theor. Comput. Sci.\u00a0354(2), 211\u2013229 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: POPL, pp. 85\u201394 (1995)","DOI":"10.1145\/199448.199468"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16901-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T04:12:48Z","timestamp":1559794368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16901-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169007","9783642169014"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16901-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}