{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:29Z","timestamp":1725572189930},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_41","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T12:59:50Z","timestamp":1292590790000},"page":"537-549","source":"Crossref","is-referenced-by-count":0,"title":["Compositional Verification: Decidability Issues Using Graph Substitutions"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"Grumberg, O., Long, D.: Model Checking and Modular Verification. ACM Trans. on Prog. Lang. & Syst.\u00a016, 843\u2013871 (1994)","journal-title":"ACM Trans. on Prog. Lang. & Syst."},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Lamport, L.: Composing Specifications. ACM Transactions on Prog. Lang. and Systems (TOPLAS)\u00a015, 73\u2013132 (1993)","journal-title":"ACM Transactions on Prog. Lang. and Systems (TOPLAS)"},{"key":"41_CR3","unstructured":"M., C.E., Long, D.E., McMillan, K.L.: Compositional Model Checking. In: Proc. of the 4th Symp. on Logic in Comp. Sci (LICS 1989), pp. 353\u2013362 (1989)"},{"key":"41_CR4","first-page":"89","volume-title":"Proc. of the 20th Symposium on Security and Privacy","author":"T. Jensen","year":"1999","unstructured":"Jensen, T., Le M\u00e9tayer, D., Thorn, T.: Verifying Security Properties of Control- Flow Graphs. In: Proc. of the 20th Symposium on Security and Privacy, Berkeley, pp. 89\u2013103. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-45923-5_2","volume-title":"Fundamental Approaches to Software Engineering","author":"G. Barthe","year":"2002","unstructured":"Barthe, G., Gurov, D., Huisman, M.: Compositional Verification of Secure Applet Interactions. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol.\u00a02306, pp. 15\u201332. Springer, Heidelberg (2002)"},{"key":"41_CR6","unstructured":"Barthe, G., Courtieu, P., Dufay, G., Huisman, M., Mello de Sousa, S., Chugunov, G., Fredlund, L.A., Gurov, D.: Temporal Logic and Toolset for Applet Verification: Compositional Reasoning, Model Checking, Abstract Interpretation. Technical report, VERIFICARD Project, \n                    \n                      http:\/\/www.verificard.org\/\n                    \n                    \n                   (September 2002) Deliverable 4.1"},{"key":"41_CR7","unstructured":"Sprenger, C., Gurov, D., Huisman, M.: Simulation Logic, Applets and Compositional Verification. Technical Report 4890, INRIA (2003)"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46562-6_22","volume-title":"Perspectives of System Informatics","author":"M. Dam","year":"2000","unstructured":"Dam, M., Gurov, D.: Compositional verification of CCS processes. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol.\u00a01755, pp. 247\u2013256. Springer, Heidelberg (2000)"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/BFb0015773","volume-title":"Automata, Languages and Programming","author":"C. Stirling","year":"1985","unstructured":"Stirling, C.: A complete compositional modal proof system for a subset of CCS. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 475\u2013486. Springer, Heidelberg (1985)"},{"key":"41_CR10","first-page":"144","volume-title":"9th Symp. on Logic in Comp. Sci. (LICS 1994)","author":"H.R. Andersen","year":"1994","unstructured":"Andersen, H.R., Stirling, C., Winskel, G.: A compositional proof system for the modal mu-calculus. In: 9th Symp. on Logic in Comp. Sci (LICS 1994), pp. 144\u2013153. IEEE Comp. Soc. Press, Los Alamitos (1994)"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/10722167_14","volume-title":"Computer Aided Verification","author":"K.S. Namjoshi","year":"2000","unstructured":"Namjoshi, K.S., Trefler, R.J.: On the completeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 139\u2013153. Springer, Heidelberg (2000)"},{"key":"41_CR12","first-page":"479","volume-title":"Model Theoretic Logic","author":"Y. Gurevich","year":"1985","unstructured":"Gurevich, Y.: Monadic Second-Order Theories. In: Barwise, J., Feferman, S. (eds.) Model Theoretic Logic, pp. 479\u2013506. Springer, Heidelberg (1985)"},{"key":"41_CR13","first-page":"343","volume":"23","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.: Some New Results on the Well-Quasi Ordering of Graphs. Annals of Discrete Math.\u00a023, 343\u2013354 (1984)","journal-title":"Annals of Discrete Math."},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M. Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree-width and good register allocation. Inf. and Comp.\u00a0142, 159\u2013181 (1998)","journal-title":"Inf. and Comp."},{"key":"41_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-45643-0_7","volume-title":"Algorithm Engineering and Experiments","author":"J. Gustedt","year":"2002","unstructured":"Gustedt, J., Maehle, O., Telle, J.: The treewidth of java programs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, p. 86. Springer, Heidelberg (2002) (to appear)"},{"key":"41_CR16","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, Salomaa (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D.E. Muller","year":"1985","unstructured":"Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and secondorder logic. Theoretical Comp. Sci.\u00a037, 51\u201375 (1985)","journal-title":"Theoretical Comp. Sci."},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: The Monadic Second-order Logic of Graphs II: Infinite Graphs of Bounded Width. Math. Syst. Theory\u00a021, 187\u2013221 (1989)","journal-title":"Math. Syst. Theory"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Drewes, F., Kreowski, H.J., A., H.: Hyperedge Replacement Graph Grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, pp. 95\u2013162. World Scientific, Singapore (1997)","DOI":"10.1142\/9789812384720_0002"},{"key":"41_CR20","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Technical report, LIFL \u2013 France (2003), \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"key":"41_CR21","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of Second-Order Theories and Automata on Infinite Trees. Trans. of the A.M.S.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. of the A.M.S."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:28:00Z","timestamp":1619998080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}