{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:10:12Z","timestamp":1744157412239,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_18","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T03:47:41Z","timestamp":1347940061000},"page":"264-278","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Blume","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. J. Sander","family":"Bruggink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Engelke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata). In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 158\u2013174. Springer, Heidelberg (2010)"},{"key":"18_CR2","unstructured":"Andersen, H.R.: An introduction to binary decision diagrams. Course Notes (1997), http:\/\/www.configit.com\/fileadmin\/Configit\/Documents\/bdd-eap.pdf"},{"issue":"2-3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Mathematical Systems Theory\u00a020(2-3), 83\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Becker, B., Beyer, D., Giese, H., Klein, F., Schilling, D.: Symbolic invariant verification for systems with dynamic structural adaptation. In: Proc. of ICSE 2006 (International Conference on Software Engineering), pp. 72\u201381. ACM (2006)","DOI":"10.1145\/1134285.1134297"},{"key":"18_CR5","unstructured":"Blume, C.: Graphsprachen f\u00fcr die Spezifikation von Invarianten bei verteilten und dynamischen Systemen. Master\u2019s thesis, Universit\u00e4t Duisburg-Essen (2008)"},{"key":"18_CR6","unstructured":"Blume, C., Bruggink, S., Friedrich, M., K\u00f6nig, B.: Treewidth, pathwidth and cospan decompositions. In: Proc. of GT-VMT 2011 (2011)"},{"key":"18_CR7","unstructured":"Blume, C., Bruggink, S., K\u00f6nig, B.: Recognizable graph languages for checking invariants. In: Proc. of GT-VMT 2010. ECEASST, vol.\u00a029 (2010)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11823230_5","volume-title":"Static Analysis","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 52\u201370. Springer, Heidelberg (2006)"},{"key":"18_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":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-87405-8_23","volume-title":"Graph Transformations","author":"H.J.S. Bruggink","year":"2008","unstructured":"Bruggink, H.J.S., K\u00f6nig, B.: On the Recognizability of Arrow and Graph Languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 336\u2013350. Springer, Heidelberg (2008)"},{"key":"18_CR11","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (October 12, 2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"18_CR13","unstructured":"Courcelle, B., Durand, I.: Verifying monadic second order graph properties with tree automata. In: European Lisp Symposium (May 2010)"},{"issue":"6","key":"18_CR14","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J. Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. Journal of the ACM\u00a049(6), 716\u2013752 (2002)","journal-title":"Journal of the ACM"},{"issue":"3-4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a015(3-4), 149\u2013171 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"18_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G. Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Journal of Artificial Intelligence\u00a0174(1), 105\u2013132 (2010)","journal-title":"Journal of Artificial Intelligence"},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905410200128X","volume":"13","author":"N. Klarlund","year":"2002","unstructured":"Klarlund, N., M\u00f8ller, A., Schwartzbach, M.I.: MONA implementation secrets. International Journal of Foundations of Computer Science\u00a013(4), 571\u2013586 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Courcelle\u2019s theorem \u2013 a game-theoretic approach. Discrete Optimization (2011)","DOI":"10.1016\/j.disopt.2011.06.001"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311\u2013320. IEEE (2005)","DOI":"10.1109\/LICS.2005.40"},{"key":"18_CR20","unstructured":"Soguet, D.: G\u00e9n\u00e9ration automatique d\u2019algorithmes lin\u00e9aires. Ph.D. thesis, Universit\u00e9 Paris-Sud (2008)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M. Wulf De","year":"2006","unstructured":"De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A New Algorithm for Checking Universality of Finite Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 17\u201330. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T23:34:52Z","timestamp":1744155292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}