{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:49:45Z","timestamp":1725518985485},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878902"},{"type":"electronic","value":"9783540878919"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-87891-9_11","type":"book-chapter","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T02:48:06Z","timestamp":1223520486000},"page":"163-179","source":"Crossref","is-referenced-by-count":7,"title":["Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Both","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolf","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/258077.258078","volume":"6","author":"R. Allen","year":"1997","unstructured":"Allen, R., Garlan, S.: A formal basis for architectural connection. ACM Transactions on Software Engineering and Methodology\u00a06(3), 213\u2013249 (1997)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 207\u2013220. Springer, Heidelberg (2001)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/3-540-48224-5_54","volume-title":"Automata, Languages and Programming","author":"M. Benedikt","year":"2001","unstructured":"Benedikt, M., Godefroid, P., Reps, T.: Model checking of unrestricted hierarchical state machines. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 652\u2013666. Springer, Heidelberg (2001)"},{"issue":"5-6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-0190(00)00055-7","volume":"74","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Esparza, J., Finkel, A., Maler, O., Rossmanith, P., Willems, B., Wolper, P.: An efficient automata approach to some problems on context-free grammars. Information Processing Letters\u00a074(5-6), 221\u2013227 (2000)","journal-title":"Information Processing Letters"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/3-540-61604-7_71","volume-title":"CONCUR \u201996: Concurrency Theory","author":"A. Bouajjani","year":"1996","unstructured":"Bouajjani, A., Habermehl, P.: Constrained properties, semilinear systems, and petri nets. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 481\u2013497. Springer, Heidelberg (1996)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0084787","volume-title":"CONCUR \u201992","author":"O. Burkart","year":"1992","unstructured":"Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 123\u2013137. Springer, Heidelberg (1992)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-48654-1_9","volume-title":"CONCUR \u201994: Concurrency Theory","author":"O. Burkart","year":"1994","unstructured":"Burkart, O., Steffen, B.: Pushdown processes: Parallel composition and model checking. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 98\u2013113. Springer, Heidelberg (1994)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11691372_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Chaki","year":"2006","unstructured":"Chaki, S., Clarke, E.M., Kidd, N., Reps, T.W., Touili, T.: Verifying concurrent message-passing c programs with recursive calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 334\u2013349. Springer, Heidelberg (2006)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-47910-4_15","volume-title":"ECOOP \u201993 - Object-Oriented Programming","author":"C. Chambers","year":"1993","unstructured":"Chambers, C.: Predicate classes. In: Nierstrasz, O. (ed.) ECOOP 1993. LNCS, vol.\u00a0707, pp. 268\u2013296. Springer, Heidelberg (1993)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 232\u2013247. Springer, Heidelberg (2000)"},{"key":"11_CR11","unstructured":"Freudig, J., L\u00f6we, W., Neumann, R., Trapp, M.: Subtyping of context-free classes. In: Proceedings 3rd White Object Oriented Nights (1998)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-24626-8_22","volume-title":"Radical Innovations of Software and Systems Engineering in the Future","author":"H.W. Schmidt","year":"2004","unstructured":"Schmidt, H.W., Kr\u00e4mer, B.J., Poernemo, I., Reussner, R.: Predictable component architectures using dependent finite state machines. In: Wirsing, M., Knapp, A., Balsamo, S. (eds.) RISSEF 2002. LNCS, vol.\u00a02941, pp. 310\u2013324. Springer, Heidelberg (2004)"},{"key":"11_CR13","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"11_CR14","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., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 282\u2013298. Springer, Heidelberg (2008)"},{"key":"11_CR15","first-page":"351","volume-title":"TOOLS 29 \u2013 Technology of Object-Oriented Languages and Systems","author":"W. L\u00f6we","year":"1999","unstructured":"L\u00f6we, W., Neumann, R., Trapp, M., Zimmermann, W.: Robust dynamic exchange of implementation aspects. In: TOOLS 29 \u2013 Technology of Object-Oriented Languages and Systems, pp. 351\u2013360. IEEE, Los Alamitos (1999)"},{"issue":"1-2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Information and Computation\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Information and Computation"},{"issue":"1-2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(00)00101-8","volume":"256","author":"R. Mayr","year":"2001","unstructured":"Mayr, R.: Decidability of model checking with the temporal logic ef. Theor. Comput. Sci.\u00a0256(1-2), 31\u201362 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR18","first-page":"99","volume-title":"Object-Oriented Software Composition","author":"O. Nierstrasz","year":"1995","unstructured":"Nierstrasz, O.: Regular types for active objects. In: Nierstrasz, O., Tsichritzis, D. (eds.) Object-Oriented Software Composition, pp. 99\u2013121. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: TACAS, pp. 93\u2013107 (2005)","DOI":"10.1007\/978-3-540-31980-1_7"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/512529.512540","volume-title":"Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation","author":"G. Ramalingam","year":"2002","unstructured":"Ramalingam, G., Warshavsky, A., Field, J., Goyal, D., Sagiv, M.: Deriving specialized program analyses for certifying component-client conformance. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, pp. 83\u201394. ACM, New York (2002)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-36137-5_2","volume-title":"SOFSEM 2002: Theory and Practice of Informatics","author":"R.H. Reussner","year":"2002","unstructured":"Reussner, R.H.: Counter-constraint finite state machines: A new model for resource-bounded component protocols. In: Grosky, W.I., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2002. LNCS, vol.\u00a02540, pp. 20\u201340. Springer, Heidelberg (2002)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-24626-8_22","volume-title":"Radical Innovations of Software and Systems Engineering in the Future","author":"H.W. Schmidt","year":"2004","unstructured":"Schmidt, H.W., Kr\u00e4mer, B.J., Poernomo, I., Reussner, R.: Predictable component architectures using dependent finite state machines. In: Wirsing, M., Knapp, A., Balsamo, S. (eds.) RISSEF 2002. LNCS, vol.\u00a02941, pp. 310\u2013324. Springer, Heidelberg (2004)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-36578-8_10","volume-title":"Fundamental Approaches to Software Engineering","author":"J. Tenzer","year":"2003","unstructured":"Tenzer, J., Stevens, P.: Modelling recursive calls with uml state diagrams. In: Pezz\u00e9, M. (ed.) FASE 2003. LNCS, vol.\u00a02621, pp. 135\u2013149. Springer, Heidelberg (2003)"},{"key":"11_CR24","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.L. Torre","year":"2008","unstructured":"Torre, S.L., 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)"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/244795.244801","volume":"19","author":"D.M. Yellin","year":"1997","unstructured":"Yellin, D.M., Strom, R.E.: Protocol specifications and component adaptors. ACM Trans. Program. Lang. Syst.\u00a019(2), 292\u2013333 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR26","unstructured":"Zimmermann, W., Schaarschmidt, M.: Model checking of client-component conformance. In: 2nd Nordic Conference on Web-Services. Mathematical Modelling in Physics, Engineering and Cognitive Sciences, vol.\u00a0008, pp. 63\u201374 (2003)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11821946_1","volume-title":"Software Composition","author":"W. Zimmermann","year":"2006","unstructured":"Zimmermann, W., Schaarschmidt, M.: Automatic checking of component protocols in component-based systems. In: L\u00f6we, W., S\u00fcdholt, M. (eds.) SC 2006. LNCS, vol.\u00a04089, pp. 1\u201317. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Component-Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87891-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T12:33:46Z","timestamp":1551616426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87891-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878902","9783540878919"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87891-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}